We identify the locally finite graphs that are quantifier-eliminable and their first order theories in the signature of distance predicates.
A decomposition of locally finite graphs
โ Scribed by Bogdan Oporowski
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 501 KB
- Volume
- 117
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
An important invariant of translations of infinite locally finite graphs is that of a direction as introduced by HALIN. This invariant gives not much information if the translation is not a proper one. A new refined concept of directions is investigated. A double ray D of a graph X is said to be me
An \((m, n)\)-separator of an infinite graph \(\Gamma\) is a smallest finite set of vertices whose deletion leaves at least \(m\) finite components and at least \(n\) infinite components. It is shown that a vertex of \(\Gamma\) of finite valence belongs to only finitely many \((0,2)\)-separators. Va
The automorphism-group of an infinite graph acts in a natural way on the set of d-fibers (components of the set of rays with respect to the Hausdorff metric). For connected, locally finite, almost transitive graphs the kernel of this action is proved to be the group of bounded automorphisms. This co