ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pnp_n be the nn-th prime, with p0=1p_0=1, and let

PDn=(pℓ−pℓ−1)ℓ=1n\mathrm{PD}_n=\left(p_{\ell}-p_{\ell-1}\right)_{\ell=1}^{n}

be the first nn prime gap sequence. A prime gap graph on n≥2n\geq 2 vertices is a simple graph whose vertex degrees are exactly the entries of PDn\mathrm{PD}_n. Toroczkai's existence conjecture. For every n≥2n\geq 2, there exists a prime gap graph on nn vertices.

The conjecture asserts graphicality of every finite initial segment of the prime gap sequence; the paper establishes explicit unconditional graphicality only beyond a very large threshold, so the full assertion remains open.

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.