Minimum codegree condition for perfect matchings in k‐partite k‐graphs

Abstract: Let

H

be a

k

-partite

k

-graph with

n

vertices in each partition class, and let

d e l t a_{k - 1} (H)

denote the minimum co-degree of

H

. We characterize those

H

with

d e l t a_{k - 1} (H) g e q n / 2

and with no perfect matching. As a consequence we give an affirmative answer to the following question of R"odl and Ruci'nski: If

k

is even or

n o t e q u i v 2 p m o d 4

, does

d e l t a_{k - 1} (H) g e q n / 2

imply that

H

has a perfect matching? We also give an example indicating that it is not sufficient to impose this degree bound on only two types of

(k - 1)

-sets.

Recommendations

Cited In (3)

This page was built for publication: Minimum codegree condition for perfect matchings in k‐partite k‐graphs