ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let H∼G(n,12)H\sim G(n,\frac{1}{2}), where G(n,p)G(n,p) is the binomial random graph on nn vertices with edge probability pp. An even-non-decomposable graph is a graph with an even number of edges that is not even-decomposable. Versteegen's conjecture.

P(H is even-non-decomposable)=e−Ω(n2).\mathbb{P}(\text{$H$ is even-non-decomposable})=e^{-\Omega(n^2)}.

This is a strengthening of Versteegen's proved bound e−Ω(log⁡n)e^{-\Omega(\sqrt{\log n})} 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 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.