Perfect matchings in 3-partite 3-uniform hypergraphs

Abstract

Let $H$ be a $3$-partite $3$-uniform hypergraph, i.e. a $3$-uniform hypergraph such that every edge intersects every partition class in exactly one vertex, with each partition class of size $n$. We determine a Dirac-type vertex degree threshold for perfect matchings in $3$-partite $3$-uniform hypergraphs.

Updated. Now published in J. Combinatorial Theory Series A 127 (2014) 22-57

References in corpus (1)

• Perfect matchings in r-partite r-graphs

Cited by in corpus (1)

• A multipartite version of the Hajnal-Szemerédi theorem for graphs and hypergraphs