6 citations · 8 across the 5 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.CO2012
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs II
Andrew Treglown, Yi Zhao
Given positive integers k\geq 3 and r where k/2 \leq r \leq k-1, we give a minimum r-degree condition that ensures a perfect matching in a k-uniform hypergraph. This condition is b…
math.CO2012
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
Andrew Treglown, Yi Zhao
Given positive integers k and r where 4 divides k and k/2 \leq r \leq k-1, we give a minimum r-degree condition that ensures a perfect matching in a k-uniform hypergraph. This cond…