ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A pseudorandom class of hypergraphs is a hereditary class whose sparse random model contains, with high probability, an induced subhypergraph on at least (1−od(1))n(1-o_d(1))n 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 kk-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 kk-uniform hypergraphs resolve the question affirmatively for every k≥3k\geq 3.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.