Versteegen's random-graph conjecture for even-non-decomposable graphs
Statement
Let , where is the binomial random graph on vertices with edge probability . An even-non-decomposable graph is a graph with an even number of edges that is not even-decomposable. Versteegen's conjecture.
This is a strengthening of Versteegen's proved bound for the same probability, asserting that almost all graphs with an even number of edges are even-decomposable with an exponentially smaller exceptional proportion.
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.