Square-root diameter bound for random homomorphism ranges

Let GnG_n be a family of vertex-transitive bipartite graphs with Gn|G_n|\to\infty. Let Δn\Delta_n denote the diameter of GnG_n, and let fnf_n be uniformly random in Homvn0(Gn,Z)\operatorname{Hom}_{v_n}^0(G_n,\mathbb{Z}). Square-root diameter conjecture.

E[R(fn)]=O(Δn).\mathbf{E}[R(f_n)]=O\left(\sqrt{\Delta_n}\right).

The conjecture seeks a typical range substantially smaller than the naive O(Δn)O(\Delta_n) bound for homomorphisms. The source notes that vertex transitivity is essential: without it, a star with Δ\Delta arms of length Δ\Delta has expected range Θ(Δ)\Theta(\Delta); 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

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.