The graph positivity conjecture for random regular bipartite graphs
Statement
Let be an -regular bipartite graph with vertices, let denote its number of -matchings, and define
where is the number of -matchings in the complete graph on the same vertices. Let be the finite difference operator, so ; graph positivity means
for and . Graph positivity conjecture. As tends to infinity, the fraction of -regular bipartite graphs with 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 and 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.