The conjecture on minimizing the matching partition function for regular graphs
Statement
Let be a -regular graph. For a graph , let be its matching partition function, where is the number of matchings of size , and let denote its number of vertices. Let be the complete graph on vertices. There is also a constant , defined later in the source. Minimizing matching partition function conjecture. (a) If is even, then for all ,
(b) If is odd, then for ,
and for , the graph is never the minimizer graph. The conjecture proposes that complete graphs minimize the normalized logarithm of the matching partition function in the stated ranges; the source reports that it arose from computational evidence, while the constant is defined later in the paper. Its resolution is not established in the supplied text.
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.