regular sparse hypergraphs
arXiv:1510.07139
Abstract
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.