The lattice-quotient conjecture for extremal surface graphs
The lattice-quotient conjecture for extremal surface graphs
For , let be the class of graphs considered in the source and define
where is fixed sufficiently large and is the number of spanning trees of . Lattice-quotient conjecture. The limit is achieved by quotients of the hexagonal lattice in , and the limit is achieved by quotients of the square lattice in .
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
Sign in to submit a solution.
No solutions have been posted yet.