scientific article
From MaRDI portal
Publication:2857450
zbMath1274.05392MaRDI QIDQ2857450
Daniela Kühn, Andrew Treglown, Deryk Osthus
Publication date: 1 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311002022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Perfect matchings in uniform hypergraphs with large minimum degree
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Matchings in 3-uniform hypergraphs
- Perfect matchings in \(r\)-partite \(r\)-graphs
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Embedding large subgraphs into dense graphs
- Degrees giving independent edges in a hypergraph
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Matchings in hypergraphs of large minimum degree
This page was built for publication:
