Depth-bound conjecture for vertex-transitive graphs
Depth-bound conjecture for vertex-transitive graphs
Let be a connected vertex-transitive graph, let be finite with , let denote the vertex boundary of , and let denote the depth of . Depth-bound conjecture. There exists a fixed constant such that
This conjecture would replace the diameter in the Babai–Szegedy boundary estimate by a constant multiple of the depth, and would yield the expected quadratic bound in the paper's main theorem. Its status is not resolved in the supplied source.
Sources & referencesView supporting material
Primary source
Matt DeVos and Bojan Mohar, “Small separations in vertex transitive graphs”, arXiv:1110.4885 (2011).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.