$L_p$ regular sparse hypergraphs
Combinatorics
2018-02-27 v4 Functional Analysis
Probability
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.
Cite
@article{arxiv.1510.07139,
title = {$L_p$ regular sparse hypergraphs},
author = {Pandelis Dodos and Vassilis Kanellopoulos and Thodoris Karageorgos},
journal= {arXiv preprint arXiv:1510.07139},
year = {2018}
}