The Simonovits--Sos conjecture asserts that the largest triangle-intersecting families of graphs on a fixed n-vertex set are the families obtained by fixing a triangle and…
Statement
The Simonovits--Sos conjecture asserts that the largest triangle-intersecting families of graphs on a fixed n-vertex set are the families obtained by fixing a triangle and taking all graphs containing it. Sumner's Universal Tournament Conjecture asserts that every tournament on 2n-2 vertices contains every directed tree on n vertices.
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.