The equality of the unrestricted and triangle-free gap sequences
Statement
Let be the maximum gap among graphs on vertices, let be the corresponding maximum restricted to triangle-free graphs, and let and denote the associated sequences of positions defined in the paper. Gap-sequence equality conjecture. For every natural number and every natural number , one has
and
This is stated as a slightly weaker conjecture than the assertion that every gap-extremal graph is triangle-free; the paper proves the equality almost everywhere but leaves the all- and all- claim 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.