Transitivity conditions in infinite graphs
Matthias Hamann, Julian Pott
TL;DR
This paper investigates the symmetry properties of infinite graphs with multiple ends, providing a complete classification of distance-transitive graphs and those with k-CS-transitivity for all k ≥ 3.
Contribution
It offers a comprehensive classification of transitivity conditions in infinite graphs with multiple ends, extending understanding of their symmetry structures.
Findings
Complete classification of distance-transitive infinite graphs with multiple ends.
Classification of k-CS-transitive graphs for all k ≥ 3.
Insights into the symmetry properties of infinite graphs.
Abstract
We study transitivity properties of graphs with more than one end. We completely classify the distance-transitive such graphs and, for all , the -CS-transitive such graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Graph theory and applications