An approximate blow-up lemma for sparse hypergraphs

Allen, Peter

; and Davies, Ewan (2022) An approximate blow-up lemma for sparse hypergraphs. Procedia Computer Science, 195. 394 - 403. ISSN 1877-0509

Copy

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.

Item Type	Article
Keywords	blow-up lemma,embeddings,hypergraphs
Departments	Mathematics
DOI	10.1016/j.procs.2021.11.048
Date Deposited	17 Feb 2022 17:21
URI	https://researchonline.lse.ac.uk/id/eprint/113777

Explore Further

QA75 Electronic computers. Computer science

https://www.lse.ac.uk/Mathematics/people/Peter-Allen (Author)
https://www.lse.ac.uk/Mathematics/people/Julia-Boettcher (Author)
https://www.lse.ac.uk/Mathematics/people/Research-Students/Eng-Keat-Hng (Author)
https://www.lse.ac.uk/Mathematics/people/Jozef-Skokan (Author)
10.1016/j.procs.2021.11.048 (DOI)

picture_as_pdf

picture_as_pdf
subject: Published Version
: Available under Creative Commons: Attribution-NonCommercial-No Derivative Works 4.0

Download

Atom

BibTeX

OpenURL ContextObject in Span

OpenURL ContextObject

Dublin Core

MPEG-21 DIDL

Data Cite XML

EndNote

HTML Citation

METS

MODS

RIOXX2 XML

Reference Manager

Refer

ASCII Citation

Export

Downloads