加载中…
We study sparse hypergraphs which satisfy a mild pseudorandomness condition known as regularity. We prove appropriate regularity and counting lemmas, and we extend the relative removal lemma of Tao in this setting. This answers a question of Borgs, Chayes, Cohn and Zhao.

生成讲解博客的中文版本

生成AI智能校验的中文版本