The menger-like property of the tree-width of infinite graphs
✍ Scribed by Igor Kříž; Robin Thomas
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 395 KB
- Volume
- 52
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We define several properties of infinite graphs (structures) which are analogous to the property of being a core in a finite graph. We describe completely the relationships between these properties. We also show which of these properties are invariant under homomorphic equivalence.
Map the vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least unit distance apart. The plane-width of a graph is the minimum diameter of the image of its vertex set over all such mappings. We establish a relation between the plane-wid
Let X be an infinite k-valent graph with polynomial growth of degree d, i.e. there is an integer d and a constant c such that fx(n) 3, d> 1, 123, there exist k-valent connected graphs with polynomial growth of degree d and girth greater than 1. This means that in general the girth of graphs with pol
In this note we extend the notion of the center of a graph to infinite graphs. Thus, a vertex is in the center of the infinite graph G if it is in the center of an increasing family of finite subgraphs covering G. We give different characterizations of when a vertex is in the center of an infinite g