Linear Dependence Between Hereditary Quasirandomness Conditions

Electronic Journal Of Combinatorics

Xiaoyu He¹ 

关键词: Graph Theory;    Pseudorandomness;    Regularity lemma;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Answering a question of Simonovits and Sós, Conlon, Fox, and Sudakov proved that for any nonempty graph $H$, and any $\varepsilon>0$, there exists $\delta>0$ polynomial in $\varepsilon$, such that if $G$ is an $n$-vertex graph with the property that

【 授权许可】

Others