On Ryser's Conjecture for Linear Intersecting Multipartite Hypergraphs

Nevena Francetić, Sarada Herke, Brendan D. McKay +1

Ryser conjectured that $\tau \le (r-1)\nu$ for $r$-partite hypergraphs, where $\tau$ is the covering number and $\nu$ is the matching number. We prove this conjecture for $r\le 9$ in the specia…