Perfect matchings in uniform hypergraphs with large minimum degree
From MaRDI portal
Publication:850084
DOI10.1016/j.ejc.2006.05.008zbMath1104.05051OpenAlexW1978240867MaRDI QIDQ850084
Andrzej Ruciński, Vojtěch Rödl, Endre Szemerédi
Publication date: 15 November 2006
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2006.05.008
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
A note on exact minimum degree threshold for fractional perfect matchings, Hypergraphs without non-trivial intersecting subgraphs, Matching of Given Sizes in Hypergraphs, Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs, Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture, Fractional and integer matchings in uniform hypergraphs, Near Perfect Matchings in ${k}$-Uniform Hypergraphs II, Co-degree density of hypergraphs, Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree, The Erdős matching conjecture and concentration inequalities, Vertex degree sums for perfect matchings in 3-uniform hypergraphs, Rainbow Perfect Matchings for 4-Uniform Hypergraphs, On vertex independence number of uniform hypergraphs, Co-degree threshold for rainbow perfect matchings in uniform hypergraphs, \(d\)-matching in 3-uniform hypergraphs, Perfect matchings in 4-uniform hypergraphs, d-matching in k-uniform hypergraphs, Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels, Near Perfect Matchings ink-Uniform Hypergraphs, A note on perfect matchings in uniform hypergraphs, Exact minimum degree thresholds for perfect matchings in uniform hypergraphs, Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees, Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs, Families of triples with high minimum degree are Hamiltonian, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, On Perfect Matchings and Tilings in Uniform Hypergraphs, Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three, \(K_r\)-factors in graphs with low independence number, Matching in 3-uniform hypergraphs, Forbidding Hamilton cycles in uniform hypergraphs, Dirac-type results for loose Hamilton cycles in uniform hypergraphs, Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs, Unnamed Item, Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs, The complexity of perfect matchings and packings in dense hypergraphs, Rainbow matchings for 3-uniform hypergraphs, Perfect matchings in \(r\)-partite \(r\)-graphs, Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree, Perfect matchings in large uniform hypergraphs with large minimum collective degree, Nearly Perfect Matchings in Uniform Hypergraphs, A geometric theory for hypergraph matching, Vertex degree sums for matchings in 3-uniform hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matching theory
- Perfect matchings in \(\varepsilon\)-regular graphs
- Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Hamiltonian chains in hypergraphs
- Matchings in hypergraphs of large minimum degree
