On a hypergraph matching problem
From MaRDI portal
Publication:2494110
Recommendations
- Perfect matchings in uniform hypergraphs with large minimum degree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Perfect matchings in 4-uniform hypergraphs
- Perfect matchings in 3-uniform hypergraphs with large vertex degree
- Near perfect matchings in \(k\)-uniform hypergraphs
Cites work
- Asymptotic behavior of the chromatic index for hypergraphs
- Asymptotically good list-colorings
- scientific article; zbMATH DE number 4104975 (Why is no real title available?)
- Matchings and covers in hypergraphs
- Near perfect coverings in graphs and hypergraphs
- Near-optimal list colorings
- Nearly-perfect hypergraph packing is in NC
- On a packing and covering problem
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(41)- Extensions of Gallai's graph covering theorems for uniform hypergraphs
- Emergence and dynamics of short food supply chains
- Resolution of the Oberwolfach problem
- Matching orderable and separable hypergraphs
- Decompositions into isomorphic rainbow spanning trees
- Degenerate Turán densities of sparse hypergraphs
- The hypergraph assignment problem
- The generalised Oberwolfach problem
- Almost all optimally coloured complete graphs contain a rainbow Hamilton path
- Packing \(k\)-partite \(k\)-uniform hypergraphs
- Induced decompositions of highly dense graphs
- Matching critical intersection hypergraphs
- Santa claus meets hypergraph matchings
- Fractional decompositions of dense hypergraphs
- Santa Claus Meets Hypergraph Matchings
- The Complexity of Perfect Matching Problems on Dense Hypergraphs
- On vertex independence number of uniform hypergraphs
- scientific article; zbMATH DE number 1380611 (Why is no real title available?)
- Large triangle packings and Tuza's conjecture in sparse random graphs
- Pseudorandom hypergraph matchings
- A stochastic matching model on hypergraphs
- Minimalist designs
- Closing the random graph gap in Tuza's conjecture through the online triangle packing process
- A natural barrier in random greedy hypergraph matching
- scientific article; zbMATH DE number 6297805 (Why is no real title available?)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- A geometric theory for hypergraph matching
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- Hamilton transversals in random Latin squares
- Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture
- 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
- Conflict-free hypergraph matchings
- Cycle decompositions in \(k\)-uniform hypergraphs
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
- Resolution of the Oberwolfach problem
- The clique complex and hypergraph matching
- Packing k-partite k-uniform hypergraphs
This page was built for publication: On a hypergraph matching problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494110)
