An Approximate Blow-up Lemma for Sparse Hypergraphs

Peter Allen,Julia Böttcher,Eng Keat Hng,Jozef Skokan,Ewan Davies

PROCEEDINGS OF THE XI LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM（2021）

引用 0|浏览4

暂无评分

摘要

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. (C) 2021 The Authors. Published by Elsevier B.V.

查看译文

关键词

hypergraphs, embeddings, blow-up lemma

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要