On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- 1 January 2009
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 23 (2) , 732-748
Abstract
We study sufficient $\ell$-degree ($1\leq\ell<k$) conditions for the appearance of perfect and nearly perfect matchings in k-uniform hypergraphs. In particular, we obtain a minimum vertex degree condition ($\ell=1$) for 3-uniform hypergraphs, which is approximately tight, by showing that every 3-uniform hypergraph on n vertices with minimum vertex degree at least $(5/9+o(1))\binom{n}{2}$ contains a perfect matching.
Keywords
This publication has 10 references indexed in Scilit:
- Perfect matchings in large uniform hypergraphs with large minimum collective degreeJournal of Combinatorial Theory, Series A, 2009
- Perfect Matchings and K 4 3 -Tilings in Hypergraphs of Large CodegreeGraphs and Combinatorics, 2008
- Perfect matchings in uniform hypergraphs with large minimum degreeEuropean Journal of Combinatorics, 2006
- A Dirac-Type Theorem for 3-Uniform HypergraphsCombinatorics, Probability and Computing, 2006
- Matchings in hypergraphs of large minimum degreeJournal of Graph Theory, 2005
- Modern Graph Theory1998
- Degrees giving independent edges in a hypergraphBulletin of the Australian Mathematical Society, 1981
- Triangles in an Ordinary GraphCanadian Journal of Mathematics, 1963
- On Sets of Acquaintances and Strangers at any PartyThe American Mathematical Monthly, 1959
- On Sets of Acquaintances and Strangers at any PartyThe American Mathematical Monthly, 1959