Small separations in vertex-transitive graphs
From MaRDI portal
Abstract: Let be an integer. We prove a rough structure theorem for separations of order at most in finite and infinite vertex transitive graphs. Let be a vertex transitive graph, let be a finite vertex-set with and u sim vu in A. We show that whenever the diameter of is at least , either , or has a ring-like structure (with bounded parameters), and is efficiently contained in an interval. This theorem may be viewed as a rough characterization, generalizing an earlier result of Tindell, and has applications to the study of product sets and expansion in groups.
Recommendations
- On small separations in Cayley and vertex transitive graphs
- Local Expansion of Symmetrical Graphs
- A generalization of a theorem of Diderrich in additive group theory to vertex-transitive graphs
- On small cuts separating an abelian Cayley graph into two equal parts
- On Local Expansion of Vertex-Transitive Graphs
Cites work
- A bound for groups of linear growth
- A note on the growth of transitive graphs
- Connectivity of transitive graphs
- GRAPHS WITH POLYNOMIAL GROWTH
- Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
- scientific article; zbMATH DE number 863496 (Why is no real title available?)
- Local Expansion of Symmetrical Graphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- On the Addition of Residue Classes
- On the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphs
- The Critical Pairs of Subsets of a Group of Prime Order
- Über den Zusammenhang symmetrischer Graphen
Cited in
(3)
This page was built for publication: Small separations in vertex-transitive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439431)