Extremal aspects of graph and hypergraph decomposition problems
Stefan Glock, Daniela K\"uhn, Deryk Osthus
TL;DR
This paper surveys recent progress in graph and hypergraph decomposition theory, emphasizing extremal results related to minimum degree conditions, and highlights open problems and new research directions.
Contribution
It compiles recent advances in extremal graph and hypergraph decompositions and introduces new open problems for future research.
Findings
Summary of recent extremal decomposition results
Identification of key open problems
Formulation of new research questions
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · graph theory and CDMA systems · Advanced Graph Theory Research