Folklore conjecture on pseudorandom hypergraphs and the shattering threshold
Statement
A pseudorandom class of hypergraphs is a hereditary class whose sparse random model contains, with high probability, an induced subhypergraph on at least vertices belonging to the class. Let the shattering threshold be the size threshold at which the solution space of independent sets in a sparse random -uniform hypergraph fractures into exponentially many clusters. Folklore conjecture. There exists a pseudorandom class of hypergraphs whose independence number matches the shattering threshold. This is known for various pseudorandom graph classes, but had remained largely unexamined for higher uniformities; the paper states that uncrowded -uniform hypergraphs resolve the question affirmatively for every .
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.