Maximum volume growth conjecture for products of regular trees

About 8 years old · traced to

Let TpT_p be the infinite pp-regular tree, and let TpqT_p^q be its qq-fold Cartesian product, which is pqpq-regular. For a graph GG and vertex xx, write distx−1(i)\mathrm{dist}^{-1}_x(i) for the vertices at graph distance ii from xx, and let κ\kappa denote the graph curvature. Maximum volume growth conjecture. Let GG be a pqpq-regular graph such that, for all u,v∈V(G)u,v\in V(G), κ(u,v)≥2−ppq\kappa(u,v)\geq \frac{2-p}{pq}. If x∈V(G)x\in V(G) and y∈V(Tpq)y\in V(T_p^q), then for every i≥0i\geq 0,

∣distx−1(i)∣≤∣disty−1(i)∣.|\mathrm{dist}^{-1}_x(i)|\leq |\mathrm{dist}^{-1}_y(i)|.

The conjecture asserts that TpqT_p^q has maximal volume growth among pqpq-regular graphs with the specified curvature lower bound. In particular, the dd-dimensional lattice T2dT_2^d is conjectured to have the fastest volume growth among 2d2d-regular graphs with curvature lower bound 00; this is presented as a graph analogue of the Bishop volume comparison theorem.

References

Primary source

Brian Benson, Peter Ralli and Prasad Tetali, “Volume growth, curvature, and Buser-type inequalities in graphs”, arXiv:1802.01952 (2019).

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.