Loose hypergraph triangles versus cliques: an edge-rooted component certificate
Statement
Hypergraph triangles versus cliques
Jacque Verstraete
Known: (Kim, Ajtai--Koml'os--Szemer'edi) .
Let denote the 3-uniform hypergraph with vertex set and edges .
Known:
Conjecture (Kostochka--Mubayi--Verstraete) .
Record
- Source
- 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.