The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
From MaRDI portal
Publication:5889065
DOI10.1090/memo/1406OpenAlexW4362665105MaRDI QIDQ5889065
Deryk Osthus, Allan Lo, Daniela Kühn, Stefan Glock
Publication date: 26 April 2023
Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.06827
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40) Graph designs and isomorphic decomposition (05C51)
Related Items (27)
Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree ⋮ Probabilistic existence of regular combinatorial structures ⋮ Euler tours in hypergraphs ⋮ On asymptotic packing of convex geometric and ordered graphs ⋮ A Short proof of the blow-up lemma for approximate decompositions ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles ⋮ The number of \(n\)-queens configurations ⋮ Independence numbers of Johnson-type graphs ⋮ 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 ⋮ Coloring unions of nearly disjoint hypergraph cliques ⋮ Constructions of pairs of orthogonal latin cubes ⋮ Perfectly packing graphs with bounded degeneracy and many leaves ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Threshold for Steiner triple systems ⋮ Packing cliques in 3‐uniform hypergraphs ⋮ Graph and hypergraph packing ⋮ Minimalist designs ⋮ Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families ⋮ On a conjecture of Erdős on locally sparse Steiner triple systems ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ Resolution of the Oberwolfach problem ⋮ Hypergraphs Not Containing a Tight Tree with a Bounded Trunk ⋮ Pseudorandom hypergraph matchings ⋮ Packing degenerate graphs ⋮ Constructions and uses of incomplete pairwise balanced designs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial and computational aspects of graph packing and graph decomposition
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- Asymptotic behavior of the chromatic index for hypergraphs
- On a packing and covering problem
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- Nearly perfect matchings in regular simple hypergraphs
- Decomposing hypergraphs into simple hypertrees
- Fractional triangle decompositions of dense 3-partite graphs
- Counting designs
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Probabilistic existence of large sets of designs
- On the decomposition threshold of a given graph
- Clique decompositions of multipartite graphs and completion of Latin squares
- Probabilistic existence of regular combinatorial structures
- Fractional clique decompositions of dense graphs and hypergraphs
- On a hypergraph matching problem
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
- Euler tours in hypergraphs
- An upper bound on the number of Steiner triple systems
- A Construction of Almost Steiner Systems
- Recent advances on Dirac-type problems for hypergraphs
- On the Inversion of Certain Matrices
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Almost all Steiner triple systems have perfect matchings
- Fractional Triangle Decompositions in Graphs with Large Minimum Degree
- Asymptotic Existence of Resolvable Graph Designs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
- Note on independent sets in steiner systems
- Self‐dual embeddings of complete multipartite graphs
- Triangle Factors in Random Graphs
- New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
- Minimalist designs
- Edge-disjoint Hamilton cycles in random graphs
- Fractional Clique Decompositions of Dense Partite Graphs
- On independent sets in hypergraphs
- Edge-decompositions of graphs with high minimum degree
This page was built for publication: The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
