Maximum volume growth conjecture for products of regular trees
Maximum volume growth conjecture for products of regular trees
Let be the infinite -regular tree, and let be its -fold Cartesian product, which is -regular. For a graph and vertex , write for the vertices at graph distance from , and let denote the graph curvature. Maximum volume growth conjecture. Let be a -regular graph such that, for all , . If and , then for every ,
The conjecture asserts that has maximal volume growth among -regular graphs with the specified curvature lower bound. In particular, the -dimensional lattice is conjectured to have the fastest volume growth among -regular graphs with curvature lower bound ; this is presented as a graph analogue of the Bishop volume comparison theorem.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Brian Benson, Peter Ralli and Prasad Tetali, “Volume growth, curvature, and Buser-type inequalities in graphs”, arXiv:1802.01952 (2019).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.