关于Frankl-Füredi猜想的一个结果  

A Result on the Conjecture of Frankl-Füredi

作　　者：唐青松[1] 陆小军[1] 张祥德[1] 朱和贵[1] 

机构地区：[1]东北大学理学院,辽宁沈阳110819

出　　处：《东北大学学报（自然科学版）》2012年第8期1209-1212,1216,共5页Journal of Northeastern University(Natural Science)

基　　金：国家自然科学基金资助项目(10801026)

摘　　要：Frankl和Füredi猜测在所有边数为m的r-图中,由N(r)中Colex序最小的m个元素组成的r-图具有最大的拉格朗日极值.本文证明,对于边数为m的3-图,当[(t-1)/3]≤m≤[t-1/3]+[(t-2)/2]且t≤8时,这一猜想成立.It was conjectured by Frankl and Füredi that the r-graph with m edges formed by taking the first m elements in the Colex ordering of N（r）had the largest Lagrangian of all r-graphs with m edges.In this paper,it is proved that when the following relationships are given for the 3-graph with m edges,i.e.,[（t-1）/3]≤m≤[t-1/3]＋[（t-2）/2] and t≤8,this conjecture will be right.

关 键 词：超图 拉格朗日极值 Frankl-Füredi猜想 Colex序 Turán问题 

分 类 号：O157.5[理学—数学]