Title of article
Perfect matchings in 3-partite 3-uniform hypergraphs
Author/Authors
Lo، نويسنده , , Allan and Markstrِm، نويسنده , , Klas، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2014
Pages
36
From page
22
To page
57
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.
Keywords
k-partite , minimum degree , Hypergraph , Perfect matching
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2014
Journal title
Journal of Combinatorial Theory Series A
Record number
1532040
Link To Document