ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a dd-regular graph. For a graph HH, let MH(λ)=∑kmk(H)λkM_H(\lambda)=\sum_k m_k(H)\lambda^k be its matching partition function, where mk(H)m_k(H) is the number of matchings of size kk, and let v(H)v(H) denote its number of vertices. Let Kd+1K_{d+1} be the complete graph on d+1d+1 vertices. There is also a constant cdc_d, defined later in the source. Minimizing matching partition function conjecture. (a) If dd is even, then for all λ≥0\lambda\geq 0,

1v(G)ln⁡MG(λ)≥1v(Kd+1)ln⁡MKd+1(λ).\frac{1}{v(G)}\ln M_G(\lambda)\geq \frac{1}{v(K_{d+1})}\ln M_{K_{d+1}}(\lambda).

(b) If dd is odd, then for 0≤λ≤cd0\leq \lambda\leq c_d,

1v(G)ln⁡MG(λ)≥1v(Kd+1)ln⁡MKd+1(λ),\frac{1}{v(G)}\ln M_G(\lambda)\geq \frac{1}{v(K_{d+1})}\ln M_{K_{d+1}}(\lambda),

and for λ>cd\lambda>c_d, the graph Kd+1K_{d+1} 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 cdc_d 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.