A Counterexample to a Conjecture of Lovász

Alexander Clow, Penny Haxell, Bojan Mohar

In 1975 Lovász conjectured that every $r$-partite, $r$-uniform hypergraph contains $r-1$ vertices whose deletion reduces the matching number. If true, this statement would imply a…