Nearly perfect matchings in uniform hypergraphs

Abstract: In this paper, we study degree conditions for the existence of large matchings in uniform hypergraphs. We prove that for integers

k, l, n

with

k g e 3

,

k / 2 < l < k

, and

n

large, if

H

is a

k

-uniform hypergraph on

n

vertices and

d e l t a_{l} (H) > n - l c h o o s e k - l - (n - l) - (l c e i l n / k c e i l - 2) c h o o s e 2

, then

H

has a matching covering all but a constant number of vertices. When

l = k - 2

and

k g e 5

, such a matching is near perfect and our bound on

d e l t a_{l} (H)

is best possible. When

k = 3

, with the help of an absorbing lemma of H'{a}n, Person, and Schacht, our proof also implies that

H

has a perfect matching, a result proved by K" uhn, Osthus, and Treglown and, independently, of Kahn.

Recommendations

Cites work

Cited in

(19)

This page was built for publication: Nearly perfect matchings in uniform hypergraphs