Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree

We prove that any quasirandom uniform hypergraph \(H\) can be approximately decomposed into any collection of bounded degree hypergraphs with almost as many edges. In fact, our results also apply to multipartite hypergraphs and even to the sparse setting when the density of \(H\) quickly tends to \(...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2021-01
Hauptverfasser:	Ehard, Stefan, Joos, Felix
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Decomposition Graph theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!