ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an rr-regular bipartite graph with v=2nv=2n vertices, let mim_i denote its number of ii-matchings, and define

d(i)=ln⁡(miri)−ln⁡(m‾i(v−1)i),d(i)=\ln\left(\frac{m_i}{r^i}\right)-\ln\left(\frac{\overline{m}_i}{(v-1)^i}\right),

where m‾i\overline{m}_i is the number of ii-matchings in the complete graph on the same vertices. Let Δ\Delta be the finite difference operator, so Δd(i)=d(i+1)−d(i)\Delta d(i)=d(i+1)-d(i); graph positivity means

Δkd(i)≥0\Delta^k d(i)\geq 0

for k=0,…,vk=0,\ldots,v and i=0,…,v−ki=0,\ldots,v-k. Graph positivity conjecture. As nn tends to infinity, the fraction of rr-regular bipartite graphs with 2n2n vertices that satisfy graph positivity approaches one. The paper reports computer evidence for this claim, while the subsequent weak graph positivity result establishes the corresponding assertion for each fixed ii and kk rather than for all meaningful finite differences simultaneously.

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.