Toroczkai's existence conjecture for prime gap graphs
Statement
Let be the -th prime, with , and let
be the first prime gap sequence. A prime gap graph on vertices is a simple graph whose vertex degrees are exactly the entries of . Toroczkai's existence conjecture. For every , there exists a prime gap graph on 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.