ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let gap(n){\rm gap}(n) be the maximum gap among graphs on nn vertices, let gap2(n){\rm gap}_2(n) be the corresponding maximum restricted to triangle-free graphs, and let s(t)s(t) and s2(t)s_2(t) denote the associated sequences of positions defined in the paper. Gap-sequence equality conjecture. For every natural number nn and every natural number tt, one has

gap(n)=gap2(n){\rm gap}(n)={\rm gap}_2(n)

and

s(t)=s2(t).s(t)=s_2(t).

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-nn and all-tt 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 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.