| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4655285 | Journal of Combinatorial Theory, Series A | 2014 | 36 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Allan Lo, Klas Markström,