The Extremal Function for Cycles of Length $\ell$ mod $k$

Electronic Journal Of Combinatorics

Benny Sudakov¹ 

关键词: Cycle lengths;    Turán numbers;    Chromatic number;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Burr and Erdős conjectured that for each $k,\ell \in \mathbb Z^+$ such that $k \mathbb Z + \ell$ contains even integers, there exists $c_k(\ell)$ such that any graph of average degree at least $c_k(\ell)$ contains a cycle of length $\ell$ mod $k$. This co

【 授权许可】

Others