A counterexample to Ryser's covering conjecture
There exists such that, for every prime with , there is an integer such that for every odd integer and , there is a finite intersecting -partite -uniform hypergraph satisfying , disproving the intersecting case of Ryser's covering conjecture.
The proof is complete and rigorous, combining the incidence bound (Theorem 2.1), random deletion lemma (Lemma 3.2), compatible translate selection (Theorem 4.1), small-field configuration (Lemma 5.1), and ambient placement (Sections 6-7), with only three standard elementary estimates imported from the companion paper [27, Appendix A].
“Theorem 1.1. There exists s0 such that, for every prime s ≥ s0 with s ≡ 2 (mod 3), there is an integer n0(s) ≥ 3 with the following property. For every odd integer n ≥ n0(s), put q = sn. There is a finite intersecting (q + 1)-partite (q + 1)-uniform hypergraph H satisfying τ (H) = q + 1. In particular, the intersecting case of (1) is false.” · Show in paper