scientific article

zbMath1274.05386MaRDI QIDQ2857424

Richard Mycroft

Publication date: 1 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311001776

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs

Cites Work

• Packing \(k\)-partite \(k\)-uniform hypergraphs
• Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Tiling Turán theorems
• \(H\)-factors in dense graphs
• A hypergraph blow-up lemma
• Degrees giving independent edges in a hypergraph
• Polynomial-time perfect matchings in dense hypergraphs
• Proof of the Alon-Yuster conjecture

This page was built for publication: