Counting in hypergraphs via regularity inheritance

详细信息    查看全文

• 作者：Ewan Davies ^{E.S.Davies@lse.ac.uk" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Hypergraph regularity ; counting lemma ; regularity inheritance
• 刊名：Electronic Notes in Discrete Mathematics
• 出版年：2015
• 出版时间：November 2015
• 年：2015
• 卷：49
• 期：Complete
• 页码：413-417
• 全文大小：192 K

文摘

We develop a theory of regularity inheritance in 3-uniform hypergraphs. As a simple consequence we deduce a strengthening of a counting lemma of Frankl and Rödl. We believe that the approach is sufficiently flexible and general to permit extensions of our results in the direction of a hypergraph blow-up lemma.