Note on limits of finite graphs
✍ Scribed by Gábor Elek
- Publisher
- Springer-Verlag
- Year
- 2007
- Tongue
- English
- Weight
- 129 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract We show that all graphs with a simple extension property are projective. As a consequence of this result we settle in the affirmative a conjecture of Larose and Tardif and characterize all homogeneous graphs which are projective. © 2004 Wiley Periodicals, Inc. J Graph Theory 47: 81–86,
A geometric graph is a graph drawn in the plane so that the vertices are represented by points in general position and the edges are represented by straight line segments connecting the corresponding points. We show that a geometric graph of n vertices with no k+1 pairwise disjoint edges has at most
This note provides counter-examples to a conjecture of D.A. Holton on stability of graphs. It is shown that even though the automorphism groups of two graphs are identical, one may be stable while the other is not.