Perfect matchings in r-partite r-graphs
Combinatorics
2009-11-23 v1
Abstract
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.
Cite
@article{arxiv.0911.4008,
title = {Perfect matchings in r-partite r-graphs},
author = {Ron Aharoni and Agelos Georgakopoulos and Philipp Sprüssel},
journal= {arXiv preprint arXiv:0911.4008},
year = {2009}
}
Comments
6 pages