2016/08/17 by Lu, Hongliang, Wang, Yan, Yu, Xingxing
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1608.04838
The minimum co-degree threshold for a perfect matching in a k-graph with n vertices was determined by Rödl, Ruciński and Szemerédi for the case when n≡ 0\pmod k. Recently, Han resolved the remaining cases when n \not≡ 0\pmod k, establishing a conjecture of Rödl, Ruciński and Szemerédi. In this paper, we determine the minimum co-degree threshold for almost perfect matchings in k-partite k-graphs, answering a question of Rödl and Ruciński.