Multipartite hypergraphs achieving equality in Ryser's conjecture

Ron Aharoni, János Barát, Ian M. Wanless

A famous conjecture of Ryser is that in an $r$-partite hypergraph the covering number is at most $r-1$ times the matching number. If true, this is known to be sharp for $r$ for whi…