Balanced counterexamples to Ryser's conjecture at prime orders
There exists such that, for every prime , there is a finite intersecting -partite -uniform hypergraph with , , and every vertex belonging to an edge, which disproves Ryser's covering conjecture even for intersecting hypergraphs with equally sized parts.
All components of the proof—the deterministic reduction, robust deletion estimates, prime-plane stability, candidate graph bounds, transversal selection with cylinder bounds, and local pencil obstruction—are rigorously established and combined in Section 7.
“Theorem 1.1. There exists q0 such that, for every prime q ≥ q0, there is a finite intersecting (q + 1)-partite (q + 1)-uniform hypergraph H with |V1| = · · · = |Vq+1| = q + 1, τ (H) = q + 1. Every vertex belongs to an edge.” · Show in paper