On best transitive approximations to simple graphs

Abstract

Given any finite graph, which transitive graphs approximate it most closely and how fast can we find them? The answer to this question depends on the concept of “closest approximation” involved. In [8,9] a qualitative concept of best approximation is formulated. Roughly, a qualitatively best transitive approximation of a graph is a transitive graph which cannot be “improved” without also going against the original graph. A quantitative concept of best approximation goes back at least to [10]. A quantitatively best transitive approximation is a transitive graph that makes the minimal number of mistakes against the original graph. In other words, the sum of the edges that are removed from and are added to the original graph is minimal.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,098

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Ordinal operations on graph representations of sets.Laurence Kirby - 2013 - Mathematical Logic Quarterly 59 (1-2):19-26.
On transitive subrelations of binary relations.Christopher S. Hardin - 2011 - Journal of Symbolic Logic 76 (4):1429-1440.
Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
Closer.Rafael De Clercq & Leon Horsten - 2005 - Synthese 146 (3):371 - 393.
Generalizations.Timothy Williamson - 1990 - In Identity and Discrimination. Cambridge, Mass., USA: Wiley-Blackwell. pp. 109–125.
On the finiteness of the recursive chromatic number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.
Feasible graphs with standard universe.Douglas Cenzer & Jeffrey B. Remmel - 1998 - Annals of Pure and Applied Logic 94 (1-3):21-35.

Analytics

Added to PP
2009-01-28

Downloads
3 (#1,728,901)

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Leon Horsten
Universität Konstanz

Citations of this work

Closer.Rafael De Clercq & Leon Horsten - 2005 - Synthese 146 (3):371 - 393.

Add more citations

References found in this work

No references found.

Add more references