Some Extremal Problems for Hereditary Properties of Graphs

Electronic Journal Of Combinatorics

Vladimir Nikiforov¹ 

关键词: extremal problems;    Turán problems;    hereditary property;    largest eigenvalue;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Given an infinite hereditary property of graphs $\mathcal{P}$, the principal extremal parameter of $\mathcal{P}$ is the value\[ \pi\left( \mathcal{P}\right) =\lim_{n\rightarrow\infty}\binom{n}{2}^{-1}\max\{e\left( G\right) :\text{ }G\in\mathcal{P}\text{ a

【 授权许可】

Others