Record number :
1455962
Title of article :
Matchings in 3-uniform hypergraphs of large minimum vertex degree
Author/Authors :
Deryk and Treglown، نويسنده , , Andrew and Kühn، نويسنده , , Daniela and Osthus، نويسنده , , Deryk، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2011
Pages :
6
From page :
813
To page :
818
Abstract :
We determine the minimum vertex degree that ensures a perfect matching in a 3-uniform hypergraph. More precisely, suppose that H is a sufficiently large 3-uniform hypergraph whose order n is divisible by 3. If the minimum vertex degree of H is greater than ( n − 1 2 ) − ( 2 n / 3 2 ) , then H contains a perfect matching. This bound is tight and answers a question of Hàn, Person and Schacht. More generally, we determine the minimum vertex degree threshold that ensures that H contains a matching of size d ⩽ n / 3 .
Keywords :
Hypergraphs , vertex degree , Matchings
Journal title :
Electronic Notes in Discrete Mathematics
Link To Document :