Ryser's conjecture (Tuza 1983) states that every -partite
-uniform hypergraph
satisfies
where
is the vertex cover number and
is the matching number
of the hypergraph. The bound is known for
.
White (2026) proved the previously open case and
, namely
White (2026) reports that GPT-5.6 Sol found the projection lemma used in the proof, while Claude helped build the computational checker. The author verified the model-produced structural claims. As of Sep. 22, 2026, independent specialist review had not been reported.