Perfect matchings in 3-partite 3-uniform hypergraphs
Combinatorics
2014-10-15 v2
Abstract
Let be a -partite -uniform hypergraph, i.e. a -uniform hypergraph such that every edge intersects every partition class in exactly one vertex, with each partition class of size . We determine a Dirac-type vertex degree threshold for perfect matchings in -partite -uniform hypergraphs.
Cite
@article{arxiv.1103.5654,
title = {Perfect matchings in 3-partite 3-uniform hypergraphs},
author = {Allan Lo and Klas Markström},
journal= {arXiv preprint arXiv:1103.5654},
year = {2014}
}
Comments
Updated. Now published in J. Combinatorial Theory Series A 127 (2014) 22-57