Near Perfect Matchings in ${k}$-Uniform Hypergraphs II
From MaRDI portal
Publication:3185658
DOI10.1137/15M1029990zbMath1342.05115arXiv1507.02362OpenAlexW3106377484MaRDI QIDQ3185658
Publication date: 4 August 2016
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.02362
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (5)
Matching of Given Sizes in Hypergraphs ⋮ Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture ⋮ A Ramsey–Turán theory for tilings in graphs ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ The complexity of perfect matchings and packings in dense hypergraphs
Cites Work
- Unnamed Item
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Tight co-degree condition for perfect matchings in 4-graphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- Polynomial-time perfect matchings in dense hypergraphs
- Minimum vertex degree thresholds for tiling complete 3-partite 3-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
- A note on perfect matchings in 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
- \(F\)-factors in hypergraphs via absorption
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- Fractional and integer matchings in uniform hypergraphs
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- Recent advances on Dirac-type problems for hypergraphs
- Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs
- COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY
- Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Embedding large subgraphs into dense graphs
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Near Perfect Matchings ink-Uniform Hypergraphs
- Matchings in hypergraphs of large minimum degree
- A geometric theory for hypergraph matching
This page was built for publication: Near Perfect Matchings in ${k}$-Uniform Hypergraphs II
