On Ryser's conjecture

Journal article

Motivated by an old problem known as Ryser's Conjecture, we prove that for r = 4 and r = 5, there exists ∈ > 0 such that every r-partite r-uniform hypergraph H has a cover of size at most (r - ∈)v(H), where v(H) denotes the size of a largest matching in H.

Authors: Haxell, P; Scott, A

• Publication status: Published
• Journal: ELECTRONIC JOURNAL OF COMBINATORICS
• Volume: 19
• Issue: 1
• Publication date: 2012-01-21
• EISSN: 1077-8926
• ISSN: 1077-8926
• Language: English