Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
From MaRDI portal
Publication:2848550
DOI10.1137/10080796XzbMath1272.05160arXiv1101.5830OpenAlexW2962759378MaRDI QIDQ2848550
Publication date: 26 September 2013
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1101.5830
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Perfect packings in quasirandom hypergraphs. I. ⋮ Stability on matchings in 3-uniform hypergraphs ⋮ 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 ⋮ A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs ⋮ Vertex degree sums for perfect matchings in 3-uniform hypergraphs ⋮ Rainbow Perfect Matchings for 4-Uniform Hypergraphs ⋮ On vertex independence number of uniform hypergraphs ⋮ Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs ⋮ Co-degree threshold for rainbow perfect matchings in uniform hypergraphs ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ 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 ⋮ Perfect matchings in 4-uniform hypergraphs ⋮ d-matching in k-uniform hypergraphs ⋮ Near Perfect Matchings ink-Uniform Hypergraphs ⋮ A note on perfect matchings in uniform hypergraphs ⋮ Perfect Packings in Quasirandom Hypergraphs II ⋮ Minimum Codegree Threshold forC63-Factors in 3-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 ⋮ Polynomial-time perfect matchings in dense hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ Note on matchings in 3-partite 3-uniform hypergraphs ⋮ Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs ⋮ On the Hamiltonicity of triple systems with high minimum degree ⋮ Matching in 3-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 ⋮ Nearly Perfect Matchings in Uniform Hypergraphs ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs ⋮ A geometric theory for hypergraph matching ⋮ Vertex degree sums for matchings in 3-uniform hypergraphs ⋮ \(F\)-factors in hypergraphs via absorption ⋮ Minimum Vertex Degree Threshold for ‐tiling* ⋮ Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
