.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
Turan's theorem is a cornerstone of extremal graph theory. It asserts that for any integer r >= 2, every graph on n vertices with more than r-2/2(r-1) . n(2) edges contains a clique of size r, i.e., r mutually adjacent vertices. The corresponding extremal graphs are balanced (r - 1)-partite graphs. The question as to how many such r-cliques appear at least in any n-vertex graph with gamma n(2) edges has been intensively studied in the literature. In particular, Lovasz and Simonovits conjectured in the 1970's that asymptotically the best possible lower bound is given by the complete multipartite graph with 7712 edges in which all but one vertex class is of the same size while the remaining one may be smaller. Their conjecture was recently resolved for r = 3 by Razborov and for r = 4 by Nikiforov. In this article, we prove the conjecture for all values of r.
Keyword:
TRIANGLES
NUMBER
GRAPHS
期刊
IF:
5.3
论文数:
1.4K
被引数:
1.6W
机构
引用论文
Contribution of Hydroxyl Radical to the Production of Methylguanidine from Creatinine羟基自由基对肌酐生成甲基胍的贡献.png)
Nephron.png)
NephronIF0
PREAI
.png){kind=icon}
分享.png){kind=icon}
收藏分享收藏Genetic and physiological approaches toward understanding the mechanisms underlying the sulfur-regulated expression of β-conglycinin genes遗传和生理学方法用于理解硫调控β-伴大豆球蛋白基因表达的机制
OAAI
OAAI分享收藏Temporary application of nitrate to nitrogen-deficient soybean plants at the mid- to late-stages of seed development increased the accumulation of the β-Subunit of β-conglycinin, a major seed storage protein在种子发育的中后期，对缺氮的大豆植株临时施加硝酸盐，增加了主要种子贮藏蛋白β-伴大豆球蛋白β亚基的积累。
PREAI
分享收藏分享收藏 没有更多内容
没有更多内容