On Ryser's conjecture (Q426782)

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