Clique-saturating non-edges problem of He, Ma, Ma and Ye
Statement
For an integer , let denote the maximum number of edges in an -vertex -free graph. For integers and , define to be the minimum, over all -vertex -free graphs with edges, of the number of non-edges such that adding to creates a copy of . Determine the asymptotic value of , for every fixed , throughout the range .
Record
- Added
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.