The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree

Paths, Trees, and Flowers

Jack Edmonds · Canadian Journal of Mathematics · 1965 · 2.4K citations · Full text

Natural Sciences, Computer Science, Mathematics +16

A Dirac-Type Theorem for 3-Uniform Hypergraphs

Vojtěch Rödl, Andrzej Ruciński, Endre Szemerédi · Combinatorics Probability Computing · 2006 · 250 citations

Natural Sciences, Computer Science, Mathematics +9

The NP-Completeness of Some Edge-Partition Problems

Ian Holyer · SIAM Journal on Computing · 1981 · 218 citations

Computing, Computer Science, Mathematics +12

On the Complexity of General Graph Factor Problems

David Kirkpatrick, Pavol Hell · SIAM Journal on Computing · 1983 · 209 citations

Computing, Computer Science, Mathematics +15

H-Factors in Dense Graphs

Noga Alon, Raphael Yuster · Journal of Combinatorial Theory Series B · 1996 · 173 citations

Computing, Computer Science, Condensed Matter Physics +3