Minimum codegree condition for perfect matchings in k-partite k-graphs |
| |
Authors: | Hongliang Lu Yan Wang Xingxing Yu |
| |
Institution: | 1. School of Mathematics and Statistics, Xi'an Jiaotong University, Xi'an, China;2. School of Mathematics, Georgia Institute of Technology, Atlanta, Georgia |
| |
Abstract: | Let be a -partite -graph with vertices in each partition class, and let denote the minimum codegree of . We characterize those with and with no perfect matching. As a consequence, we give an affirmative answer to the following question of Rödl and Ruciński: if is even or , does imply that 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 -sets. |
| |
Keywords: | k-graph k-partite k-graph matching perfect matching |
|
|