Graph and hypergraph packing
From MaRDI portal
Publication:6198635
DOI10.4171/icm2022/136OpenAlexW4389774929MaRDI QIDQ6198635
Publication date: 20 March 2024
Published in: International Congress of Mathematicians (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4171/icm2022/136
Hypergraphs (05C65) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Combinatorial aspects of packing and covering (05B40) Graph designs and isomorphic decomposition (05C51)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximate version of the tree packing conjecture
- Packing minor-closed families of graphs into complete graphs
- Rainbow matchings in bipartite multigraphs
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- On a packing and covering problem
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- Blow-up lemma
- Counting designs
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Resolution of the Oberwolfach problem
- Embedding rainbow trees with applications to graph labelling and decomposition
- Progress towards Nash-Williams' conjecture on triangle decompositions
- Optimal packings of bounded degree trees
- Packing degenerate graphs
- Spanning trees in random graphs
- On the decomposition threshold of a given graph
- Probabilistic existence of regular combinatorial structures
- Fractional clique decompositions of dense graphs and hypergraphs
- On a hypergraph matching problem
- The module structure of integral designs
- 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
- Packing spanning graphs from separable families
- A Short proof of the blow-up lemma for approximate decompositions
- Packing Tight Hamilton Cycles in Uniform Hypergraphs
- Coloured and Directed Designs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Fractional Triangle Decompositions in Graphs with Large Minimum Degree
- Triangle Factors in Random Graphs
- A blow-up lemma for approximate decompositions
- A bandwidth theorem for approximate decompositions
- Packing trees of unbounded degrees in random graphs
- Decompositions into spanning rainbow structures
- Pseudorandom hypergraph matchings
- Extremal aspects of graph and hypergraph decomposition problems
- Minimalist designs
- Tree decompositions of graphs without large bipartite holes
- HYPERGRAPH MATCHINGS AND DESIGNS
- Almost all trees are almost graceful
- Decomposing Graphs into Edges and Triangles
- Edge-disjoint Hamilton cycles in random graphs
- Proof of the 1-factorization and Hamilton Decomposition Conjectures
- 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
- Perfectly packing graphs with bounded degeneracy and many leaves
This page was built for publication: Graph and hypergraph packing
