On a paper of lake about infinite graphs
โ Scribed by Charles Vanden Eynden
- Book ID
- 103058838
- Publisher
- Elsevier Science
- Year
- 1977
- Tongue
- English
- Weight
- 115 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
Lake has constructed graphs G and H such that H contains n disjoint subgraphs isomorphic to G for each positive integer n, but H does not contain infinitely many disjoint subgraphs isomorphic to G. Here a cowrete example of such graphs with H the lattice pints of the plane is given.
In f2] Lake settles a question of Hahn [I] by constructing graphs G and H such that for each psitive integer n, H contains n disjoi;lit subgraphs isomorphic to G, and yet H does not contain infinitely many disjoint subgraphs isomorphic to G. The
๐ SIMILAR VOLUMES
In [4] Jung and Watkins proved that for a connected infinite graph X either rยฎ(X) = oo holds or X is a strip, if Aut(X) contains a transitive abelian subgroup G. Here we prove the same result under weaker assumptions.
We present a construction of two infinite graphs \(G_{1}, G_{2}\) and of an infinite set of graphs such that \(\mathscr{F}\) is an antichain with respect to the minor relation and, for every graph \(G\) in \(\mathscr{F}\), both \(G_{1}\) and \(G_{2}\) are subgraphs of \(G\) but no graph obtained fro