Note on Upper Density of Quasi-Random Hypergraphs

Electronic Journal Of Combinatorics

Vindya Bhat¹ 

关键词: hypergraphs;    density;    quasi-random;    jumps;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

In 1964, Erdős proved that for any $\alpha > 0$, an $l$-uniform hypergraph $G$ with $n \geq n_0(\alpha, l)$ vertices and $\alpha \binom{n}{l}$ edges contains a large complete $l$-equipartite subgraph. This implies that any sufficiently large $G$ with d

【 授权许可】

Others