Linear dependence between hereditary quasirandomness conditions

Abstract

Answering a question of Simonovits and S\' os, Conlon, Fox, and Sudakov proved that for any nonempty graph H, and any >0, there exists δ>0 polynomial in , such that if G is an n-vertex graph with the property that every U⊂eq V(G) contains pe(H)|U|v(H)δ nv(H) labeled copies of H, then G is (p,)-quasirandom in the sense that every subset U⊂eq G contains 12p|U|2 n2 edges. They conjectured that δ may be taken to be linear in and proved this in the case that H is a complete graph. We study a labelled version of this quasirandomness property proposed by Reiher and Schacht. Let H be any nonempty graph on r vertices v1,…,vr, and >0. We show that there exists δ=δ()>0 linear in , such that if G is an n-vertex graph with the property that every sequence of r subsets U1,…,Ur⊂eq V(G), the number of copies of H with each vi in Ui is pe(H)Π|Ui|δ nv(H), then G is (p,)-quasirandom.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…