Extremal aspects of graph and hypergraph decomposition problems
From MaRDI portal
Abstract: We survey recent advances in the theory of graph and hypergraph decompositions, with a focus on extremal results involving minimum degree conditions. We also collect a number of intriguing open problems, and formulate new ones.
Recommendations
- Combinatorial and computational aspects of graph packing and graph decomposition
- Recent advances on Dirac-type problems for hypergraphs
- scientific article; zbMATH DE number 1101882
- The history of degenerate (bipartite) extremal graph problems
- Decomposing large graphs with small graphs of high density
Cited in
(17)- Codismantlability and projective dimension of the Stanley-Reisner ring of special hypergraphs
- Decomposing hypergraphs into cycle factors
- Recent advances on Dirac-type problems for hypergraphs
- scientific article; zbMATH DE number 5670148 (Why is no real title available?)
- Combinatorial and computational aspects of graph packing and graph decomposition
- Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
- The history of degenerate (bipartite) extremal graph problems
- Extremal Problems for Hypergraph Blowups of Trees
- Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor
- Latin squares from multiplication tables
- Graph and hypergraph packing
- Cycle decompositions in \(k\)-uniform hypergraphs
- Approximate generalized Steiner systems and near-optimal constant weight codes
- The complexity of decomposing a graph into a matching and a bounded linear forest
- High-girth Steiner triple systems
- Fractional clique decompositions of dense hypergraphs
- On an extremal hypergraph problem related to combinatorial batch codes
This page was built for publication: Extremal aspects of graph and hypergraph decomposition problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5051746)
