Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
From MaRDI portal
Publication:439060
DOI10.1016/j.jcta.2012.04.006zbMath1305.05194arXiv1210.7356MaRDI QIDQ439060
Publication date: 1 August 2012
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.7356
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
d-matching in k-uniform hypergraphs, Almost Perfect Matchings in $k$-Partite $k$-Graphs, On Perfect Matchings and Tilings in Uniform Hypergraphs, On Directed Versions of the Hajnal–Szemerédi Theorem, Perfect Packings in Quasirandom Hypergraphs II, Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs, A geometric theory for hypergraph matching, Perfect packings in quasirandom hypergraphs. I., On vertex independence number of uniform hypergraphs, Perfect matchings in 3-partite 3-uniform hypergraphs, Polynomial-time perfect matchings in dense hypergraphs, On the numbers of 1-factors and 1-factorizations of hypergraphs, Packing \(k\)-partite \(k\)-uniform hypergraphs, Perfect matchings in 4-uniform hypergraphs, A note on perfect matchings in uniform hypergraphs, Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs, Vertex degree sums for perfect matchings in 3-uniform hypergraphs, \(d\)-matching in 3-uniform hypergraphs, Matching in 3-uniform hypergraphs, Vertex degree sums for matchings in 3-uniform hypergraphs, Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs, Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs, Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture, Near Perfect Matchings in ${k}$-Uniform Hypergraphs II
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perfect matchings in 3-partite 3-uniform hypergraphs
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Tight co-degree condition for perfect matchings in 4-graphs
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Perfect matchings in uniform hypergraphs with large minimum degree
- Perfect matchings in 4-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
- Matchings in 3-uniform hypergraphs
- Asymptotic solution of a Turán-type problem
- \(F\)-factors in hypergraphs via absorption
- On a hypergraph Turán problem of Frankl
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Perfect matchings in \(r\)-partite \(r\)-graphs
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Degrees giving independent edges in a hypergraph
- Matchings in hypergraphs of large minimum degree
- Applications of the regularity lemma for uniform hypergraphs
- The Factorization of Linear Graphs
