Graph and hypergraph packing
Other designs, configurations (05B30) Combinatorial aspects of packing and covering (05B40) Graph designs and isomorphic decomposition (05C51) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Summary: Packing problems in combinatorics concern the edge disjoint embedding of a family of guest (hyper)graphs into a given host (hyper)graph. Questions of this type are intimately connected to the field of design theory, and have a variety of significant applications. The area has seen important progress in the last two decades, with a number of powerful new methods developed. Here, I will survey some major results contributing to this progress, alongside background, and some ideas concerning the methods involved. For the entire collection see [Zbl 07816360].
- A bandwidth theorem for approximate decompositions
- A blow-up lemma for approximate decompositions
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- A Short proof of the blow-up lemma for approximate decompositions
- Almost all trees are almost graceful
- An approximate version of the tree packing conjecture
- 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
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- Blow-up lemma
- Coloured and directed designs
- Counting designs
- Decomposing graphs into edges and triangles
- Decompositions into spanning rainbow structures
- Edge-decompositions of graphs with high minimum degree
- Edge-disjoint Hamilton cycles in random graphs
- Embedding rainbow trees with applications to graph labelling and decomposition
- Extremal aspects of graph and hypergraph decomposition problems
- Fractional clique decompositions of dense graphs and hypergraphs
- Fractional clique decompositions of dense partite graphs
- Fractional triangle decompositions in graphs with large minimum degree
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- scientific article; zbMATH DE number 3950585 (Why is no real title available?)
- scientific article; zbMATH DE number 48090 (Why is no real title available?)
- scientific article; zbMATH DE number 3503285 (Why is no real title available?)
- scientific article; zbMATH DE number 3604921 (Why is no real title available?)
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- scientific article; zbMATH DE number 3448595 (Why is no real title available?)
- scientific article; zbMATH DE number 3430675 (Why is no real title available?)
- scientific article; zbMATH DE number 3308125 (Why is no real title available?)
- scientific article; zbMATH DE number 3349817 (Why is no real title available?)
- scientific article; zbMATH DE number 3353327 (Why is no real title available?)
- HYPERGRAPH MATCHINGS AND DESIGNS
- Minimalist designs
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- On a hypergraph matching problem
- On a packing and covering problem
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs
- On the decomposition threshold of a given graph
- Optimal packings of bounded degree trees
- Packing degenerate graphs
- Packing minor-closed families of graphs into complete graphs
- Packing spanning graphs from separable families
- Packing tight Hamilton cycles in uniform hypergraphs
- Packing trees of unbounded degrees in random graphs
- Perfectly packing graphs with bounded degeneracy and many leaves
- Probabilistic existence of regular combinatorial structures
- Progress towards Nash-Williams' conjecture on triangle decompositions
- Proof of the 1-factorization and Hamilton Decomposition Conjectures
- Pseudorandom hypergraph matchings
- Rainbow matchings in bipartite multigraphs
- Resolution of the Oberwolfach problem
- Spanning trees in random graphs
- The CRC handbook of combinatorial designs
- The early history of block designs
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- The module structure of integral designs
- The probabilistic method
- Tree decompositions of graphs without large bipartite holes
- Triangle Factors in Random Graphs
This page was built for publication: Graph and hypergraph packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6198635)
