Pseudorandom hypergraph matchings
From MaRDI portal
Publication:4993112
DOI10.1017/S0963548320000280zbMath1466.05147arXiv1907.09946MaRDI QIDQ4993112
Felix Joos, Stefan Ehard, Stefan Glock
Publication date: 15 June 2021
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.09946
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (11)
Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree ⋮ The generalised Oberwolfach problem ⋮ A Short proof of the blow-up lemma for approximate decompositions ⋮ 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 ⋮ Threshold for Steiner triple systems ⋮ Graph and hypergraph packing ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ Decomposing hypergraphs into cycle factors
Cites Work
- Unnamed Item
- Unnamed Item
- Perfect packings in quasirandom hypergraphs. I.
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- On a packing and covering problem
- Near perfect coverings in graphs and hypergraphs
- A dense infinite Sidon sequence
- Blow-up lemma
- Counting designs
- Matchings and covers in hypergraphs
- Asymptotically good list-colorings
- Embedding rainbow trees with applications to graph labelling and decomposition
- Optimal packings of bounded degree trees
- On a hypergraph matching problem
- Perfect matchings in \(r\)-partite \(r\)-graphs
- Packing hamilton cycles in random and pseudo-random hypergraphs
- Factors in random graphs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- A Lower Bound for Heilbronn'S Problem
- Near-optimal list colorings
- A blow-up lemma for approximate decompositions
- [https://portal.mardi4nfdi.de/wiki/Publication:4870539 A linear programming perspective on the Frankl?R�dl?Pippenger theorem]
- Perfect Matchings in Random r-regular, s-uniform Hypergraphs
- A bandwidth theorem for approximate decompositions
- Decompositions into spanning rainbow structures
- Reducibility among Combinatorial Problems
- HYPERGRAPH MATCHINGS AND DESIGNS
- A rainbow blow-up lemma for almost optimally bounded edge-colourings
- Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs
- A geometric theory for hypergraph matching
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- Probability theory. A comprehensive course
This page was built for publication: Pseudorandom hypergraph matchings
