Perfect matchings in r-partite r-graphs

Details Perfect matchings in r-partite r-graphs Perfect matchings in r-partite r-graphs

2009-11-20

arxiv.org/abs/0911.4008v1

European Journal of Combinatorics 30 (2009), 39-42

Mathematics

Combinatorics

6 pages

Scientific paper

10.1016/j.ejc.2008.02.011

Let H be an r-partite r-graph, all of whose sides have the same size n.
Suppose that there exist two sides of H, each satisfying the following
condition: the degree of each legal (r-1)-tuple contained in the complement of
this side is strictly larger than n/2. We prove that under this condition H
must have a perfect matching. This answers a question of Kuhn and Osthus.

Affiliated with

Also associated with

No associations

Rating

Perfect matchings in r-partite r-graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Perfect matchings in r-partite r-graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Perfect matchings in r-partite r-graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-432154