The joint Ramsey–Turán density conjecture for (K_3,K_7)
Statement
For , let be the limiting maximum edge density of an -vertex graph with independence number at most that admits a red/blue coloring with no red and no blue . The density conjecture. For sufficiently small ,
The source gives a construction proving the corresponding lower bound. The conjecture is the assertion that this construction is asymptotically optimal for sufficiently small .
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.