Conjecture: for every n and e, an extremal n-vertex graph with at least e edges maximizing the number of non-triangular edges can be chosen as G(a,b,c), where A is a clique of…
Statement
Conjecture: for every n and e, an extremal n-vertex graph with at least e edges maximizing the number of non-triangular edges can be chosen as G(a,b,c), where A is a clique of size a, B and C are independent sets of sizes b and c, B is joined to A and C, and A is anticomplete to C.
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.