Minimalist designs
From MaRDI portal
Publication:5120741
DOI10.1002/rsa.20915zbMath1451.05159arXiv1808.06956OpenAlexW2888000324MaRDI QIDQ5120741
Stefan Glock, Deryk Osthus, Richard Montgomery, Daniela Kühn, Ben Barber, Allan Lo
Publication date: 16 September 2020
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.06956
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)
Related Items (7)
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ Substructures in Latin squares ⋮ Large deviations in random latin squares ⋮ Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor ⋮ Threshold for Steiner triple systems ⋮ Graph and hypergraph packing ⋮ Progress towards Nash-Williams' conjecture on triangle decompositions
Cites Work
- Unnamed Item
- Unnamed Item
- Integer and fractional packings in dense graphs
- On a packing and covering problem
- Vertex coverings by monochromatic cycles and trees
- Nearly perfect matchings in regular simple hypergraphs
- Counting designs
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- The minimum degree threshold for perfect graph packings
- Optimal packings of bounded degree trees
- On the decomposition threshold of a given graph
- Clique decompositions of multipartite graphs and completion of Latin squares
- Fractional clique decompositions of dense graphs and hypergraphs
- On a hypergraph matching problem
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Fractional Triangle Decompositions in Graphs with Large Minimum Degree
- Triangle Factors in Random Graphs
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- On the exact decomposition threshold for even cycles
- A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
- Edge-disjoint Hamilton cycles in random graphs
- Fractional Clique Decompositions of Dense Partite Graphs
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- Edge-decompositions of graphs with high minimum degree
This page was built for publication: Minimalist designs
