Quasirandomness in Hypergraphs

Electronic Journal Of Combinatorics

Elad Aigner-Horev¹ 

关键词: Hypergraphs;    Quasirandom;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

An $n$-vertex graph $G$ of edge density $p$ is considered to be quasirandom if it shares several important properties with the random graph $G(n,p)$. A well-known theorem of Chung, Graham and Wilson states that many such `typical' properties are asymptoti

【 授权许可】

Others