A Stability Theorem for Matchings in Tripartite 3-Graphs

Penny Haxell, Lothar Narins

It follows from known results that every regular tripartite hypergraph of positive degree, with $n$ vertices in each class, has matching number at least $n/2$. This bound is best p…