Tutte–Coxeter graph occupancy-fraction conjecture
Statement
Let denote the occupancy fraction of a graph in the hard-core model, and let be the -cage, also known as the Levi graph or Tutte–Coxeter graph. Tutte–Coxeter occupancy-fraction conjecture. For every -regular graph of girth at least and every ,
The conjecture identifies the -cage as the maximizer in this girth-constrained problem and is open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.