| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654672 | European Journal of Combinatorics | 2009 | 4 Pages |
Abstract
Let HH be an rr-partite rr-graph, all of whose sides have the same size nn. Suppose that there exist two sides of HH, each satisfying the following condition: the degree of each legal r−1r−1-tuple contained in the complement of this side is strictly larger than n2. We prove that under this condition HH must have a perfect matching. This answers a question of Kühn and Osthus.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ron Aharoni, Agelos Georgakopoulos, Philipp Sprüssel,