arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0911.4008math.CO
收藏

r-部r-图中的完美匹配

Perfect matchings in r-partite r-graphs

Ron Aharoni, Agelos Georgakopoulos, Philipp Sprüssel

摘要:

设H是一个r-部r-图,其所有边的长度n相同。假设存在H的两边,每一边满足以下条件:每一边的补中包含的合法(r-1)-元组的度严格大于n/2。我们证明了在这个条件下,H必须有一个完美匹配。这回答了库恩和奥斯托斯的一个问题。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑