ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For an integer p≥3p\ge 3, let ex⁡(n,Kr)\operatorname{ex}(n,K_r) denote the maximum number of edges in an nn-vertex KrK_r-free graph. For integers nn and mm, define fp+1(n,m)f_{p+1}(n,m) to be the minimum, over all nn-vertex Kp+1K_{p+1}-free graphs GG with mm edges, of the number of non-edges xy∉E(G)xy\notin E(G) such that adding xyxy to GG creates a copy of Kp+1K_{p+1}. Determine the asymptotic value of fp+1(n,m)f_{p+1}(n,m), for every fixed p≥3p\ge 3, throughout the range ex⁡(n,Kp)+1≤m≤ex⁡(n,Kp+1)\operatorname{ex}(n,K_p)+1\le m\le \operatorname{ex}(n,K_{p+1}).

Record

Added
Links

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.