Extremal aspects of graph and hypergraph decomposition problems
From MaRDI portal
Publication:5051746
zbMath1504.05231arXiv2008.00926MaRDI QIDQ5051746
Stefan Glock, Deryk Osthus, Daniela Kühn
Publication date: 18 November 2022
Full work available at URL: https://arxiv.org/abs/2008.00926
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (5)
Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree ⋮ Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor ⋮ Latin squares from multiplication tables ⋮ Graph and hypergraph packing ⋮ Decomposing hypergraphs into cycle factors
This page was built for publication: Extremal aspects of graph and hypergraph decomposition problems
