The lattice-quotient conjecture for extremal surface graphs

From papers

For 3k63\leq k\leq 6, let Xn,k,g\mathcal{X}_{n,k,g} be the class of graphs considered in the source and define

σs(k)=limn(supGXn,k,gτ(G)1/n),\sigma_s(k)=\lim_{n\to\infty}\left(\sup_{G\in\mathcal{X}_{n,k,g}}\tau(G)^{1/n}\right),

where gg is fixed sufficiently large and τ(G)\tau(G) is the number of spanning trees of GG. Lattice-quotient conjecture. The limit σs(3)\sigma_s(3) is achieved by quotients of the hexagonal lattice in R2\mathbb{R}^2, and the limit σs(4)\sigma_s(4) is achieved by quotients of the square lattice in R2\mathbb{R}^2.

The conjecture proposes specific periodic lattice models for the graphs asymptotically maximizing spanning-tree growth in the surface setting. The source does not state whether it has been resolved.

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

Dmitry Jakobson and Igor Rivin, “On some extremal problems in graph theory”, arXiv:math/9907050 (1999).

Solutions 0

No solutions have been posted yet.