Square-root diameter bound for random homomorphism ranges
Square-root diameter bound for random homomorphism ranges
Let be a family of vertex-transitive bipartite graphs with . Let denote the diameter of , and let be uniformly random in . Square-root diameter conjecture.
The conjecture seeks a typical range substantially smaller than the naive bound for homomorphisms. The source notes that vertex transitivity is essential: without it, a star with arms of length has expected range ; the general vertex-transitive case remains open.
Sources & referencesView supporting material
Primary source
Itai Benjamini, Ariel Yadin and Amir Yehudayoff, “Random Graph-Homomorphisms and Logarithmic Degree”, arXiv:math/0611416 (2007).
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.