Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
From MaRDI portal
Publication:2349181
DOI10.1016/j.jcta.2013.04.008zbMath1314.05168arXiv1210.7359OpenAlexW2951771220MaRDI QIDQ2349181
Publication date: 19 June 2015
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.7359
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Perfect packings in quasirandom hypergraphs. I. ⋮ A note on exact minimum degree threshold for fractional perfect matchings ⋮ 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 ⋮ 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 ⋮ Packing \(k\)-partite \(k\)-uniform hypergraphs ⋮ Improved bound on vertex degree version of Erdős matching conjecture ⋮ Perfect matchings in 3-partite 3-uniform hypergraphs ⋮ \(d\)-matching in 3-uniform hypergraphs ⋮ Near Perfect Matchings ink-Uniform Hypergraphs ⋮ A note on perfect matchings in uniform hypergraphs ⋮ Almost Perfect Matchings in $k$-Partite $k$-Graphs ⋮ Perfect Packings in Quasirandom Hypergraphs II ⋮ Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs ⋮ Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs ⋮ Polynomial-time perfect matchings in dense hypergraphs ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs ⋮ Matching in 3-uniform hypergraphs ⋮ Forbidding Hamilton cycles in uniform hypergraphs ⋮ Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs ⋮ The complexity of perfect matchings and packings in dense hypergraphs ⋮ Rainbow matchings for 3-uniform hypergraphs ⋮ Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs ⋮ Nearly Perfect Matchings in Uniform Hypergraphs ⋮ Vertex degree sums for matchings in 3-uniform hypergraphs ⋮ A note on minimum degree condition for Hamilton \((a,b)\)-cycles in hypergraphs ⋮ Minimum Vertex Degree Threshold for ‐tiling* ⋮ Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
