An approximate blow-up lemma for sparse hypergraphs

DOI10.1016/J.PROCS.2021.11.048MaRDI QIDQ6890877zbMATH OpenFDO

Authors Peter Allen, Julia Böttcher, Eng Keat Hng, J. Skokan, Ewan Davies

Publication date 2 December 2025

Published in Procedia Computer Science (Search for Journal in Brave)

zbMATH Keywords

embeddingshypergraphsblow-up lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

This page was built for publication: An approximate blow-up lemma for sparse hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6890877)