Allen, Peter, Böttcher, Julia, Hng, Eng Keat, Skokan, Jozef and Davies, Ewan (2022) An approximate blow-up lemma for sparse hypergraphs. Procedia Computer Science, 195. 394 - 403. ISSN 1877-0509
![[img]](http://eprintstest.lse.ac.uk/style/images/fileicons/text.png) |
Text (1-s2.0-S1877050921021876-main)
- Published Version
Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (403kB) |
Identification Number: https://doi.org/10.1016/j.procs.2021.11.048
Abstract
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 |
|---|---|
| Official URL: | https://www.sciencedirect.com/journal/procedia-com... |
| Additional Information: | © 2021 The Authors |
| Divisions: | Mathematics |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Date Deposited: | 17 Feb 2022 17:21 |
| Last Modified: | 20 Sep 2025 02:08 |
| URI: | http://eprintstest.lse.ac.uk/id/eprint/113777 |
Actions (login required)
 |
View Item |
