| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653936 | European Journal of Combinatorics | 2011 | 11 Pages |
Abstract
We establish a new lower bound on the ll-wise collective minimum degree which guarantees the existence of a perfect matching in akk-uniform hypergraph, where 1≤l
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Klas Markström, Andrzej Ruciński,