Triangle-density bound for C4-free graphs
Statement
For , determine the asymptotic minimum and maximum triangle densities among sequences of finite -free graphs satisfying , , and . Equivalently, determine the lower and upper limits of , where is the number of triangles and is the clique number, over all such graph sequences.
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.