Perfect matchings in 3-partite 3-uniform hypergraphs

JOURNAL OF COMBINATORIAL THEORY SERIES A

卷:127

Article

Lo, Allan¹  Markstrom, Klas² 

[1] Univ Birmingham, Sch Math, Birmingham B15 2TT, W Midlands, England

[2] Umea Univ, Dept Math & Math Stat, S-90187 Umea, Sweden

关键词: Hypergraph;    k-partite;    Perfect matching;    Minimum degree;   

DOI  :  10.1016/j.jcta.2014.05.004

来源: Elsevier

【 摘 要 】

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. (C) 2014 Elsevier Inc. All rights reserved.

【 授权许可】

Free