The Maximal Length of a Gap between $r$-Graph Turán Densities

Electronic Journal Of Combinatorics

Oleg Pikhurko¹ 

关键词: Hypergraphs;    Turán function;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

The Turán density $\pi(\cal F)$ of a family $\cal F$ of $r$-graphs is the limit as $n\to\infty$ of the maximum edge density of an $\cal F$-free $r$-graph on $n$ vertices. Erdős [Israel J. Math, 2 (1964):183—190] proved that no Turán density can lie in the

【 授权许可】

Others