An approximate blow-up lemma for sparse hypergraphs
Allen, P.
, Böttcher, J., Hng, E. K., Skokan, J. & Davies, E.
(2022).
An approximate blow-up lemma for sparse hypergraphs.
Procedia Computer Science,
195, 394 - 403.
https://doi.org/10.1016/j.procs.2021.11.048
, Böttcher, J., Hng, E. K., Skokan, J. & Davies, E.
(2022).
An approximate blow-up lemma for sparse hypergraphs.
Procedia Computer Science,
195, 394 - 403.
https://doi.org/10.1016/j.procs.2021.11.048
We obtain an approximate sparse hypergraph version of the blow-up lemma, showing that partite hypergraphs with sufficient regularity of small subgraph counts behave as if they were complete partite for the purpose of embedding bounded degree hypergraphs.
