On a hypergraph matching problem
From MaRDI portal
Publication:2494110
DOI10.1007/s00373-005-0628-xzbMath1090.05051OpenAlexW2051071716MaRDI QIDQ2494110
Publication date: 16 June 2006
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-005-0628-x
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ The generalised Oberwolfach problem ⋮ Induced Decompositions of Highly Dense Graphs ⋮ Almost all optimally coloured complete graphs contain a rainbow Hamilton path ⋮ On vertex independence number of uniform hypergraphs ⋮ Hamilton transversals in random Latin squares ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ A proof of the Erdős-Faber-Lovász conjecture ⋮ Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor ⋮ New bounds on the size of nearly perfect matchings in almost regular hypergraphs ⋮ Graph and hypergraph packing ⋮ Minimalist designs ⋮ Decompositions into isomorphic rainbow spanning trees ⋮ Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process ⋮ Emergence and dynamics of short food supply chains ⋮ Resolution of the Oberwolfach problem ⋮ Degenerate Turán densities of sparse hypergraphs ⋮ Large triangle packings and Tuza’s conjecture in sparse random graphs ⋮ Pseudorandom hypergraph matchings ⋮ Fractional decompositions of dense hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Nearly-perfect hypergraph packing is in NC
- Asymptotic behavior of the chromatic index for hypergraphs
- On a packing and covering problem
- Near perfect coverings in graphs and hypergraphs
- Matchings and covers in hypergraphs
- Asymptotically good list-colorings
- Near-optimal list colorings