Isoperimetric conjecture for finite vertex-transitive graphs
Let be a finite, connected, vertex-transitive graph. Write for its diameter and, for a vertex set , let denote its edge boundary. Isoperimetric conjecture. If
then
for every with . This would strengthen the known lower bound for the Cheeger constant of a finite transitive graph in terms of the reciprocal of its diameter; the source gives no resolution of the conjecture.
References
Primary source
Itai Benjamini and Gady Kozma, “A Resistance Bound via an Isoperimetric Inequality”, arXiv:math/0212322 (2012).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.