paper

Linear dependence between hereditary quasirandomness conditions

arXiv:1707.05396

Abstract

Answering a question of Simonovits and S\' os, Conlon, Fox, and Sudakov proved that for any nonempty graph , and any , there exists polynomial in , such that if is an -vertex graph with the property that every contains labeled copies of , then is -quasirandom in the sense that every subset contains edges. They conjectured that may be taken to be linear in and proved this in the case that is a complete graph. We study a labelled version of this quasirandomness property proposed by Reiher and Schacht. Let be any nonempty graph on vertices , and . We show that there exists linear in , such that if is an -vertex graph with the property that every sequence of subsets , the number of copies of with each in is , then is -quasirandom.