Generalizations and strengthenings of Ryser's conjecture

Louis DeBiasio, Yigal Kamel, Grace McCourt +1

Ryser's conjecture says that for every $r$-partite hypergraph $H$ with matching number $\nu (H)$, the vertex cover number is at most $(r-1)\nu (H)$. This far reaching generalization of K…