New Turán Densities for 3-Graphs

[摘要] If $\mathcal{F}$ is a family of graphs then the Turán density of $\mathcal{F}$ is determined by the minimum chromatic number of the members of $\mathcal{F}$.

[学科分类] 离散数学和组合数学

[关键词] Hypergraph;Turán problem