【摘要】 Frankl和Füredi猜测在所有边数为m的r-图中,由N(r)中Colex序最小的m个元素组成的r-图具有最大的拉格朗日极值.本文证明,对于边数为m的3-图,当[(t-1)/3]≤m≤[t-1/3]+[(t-2)/2]且t≤8时,这一猜想成立.更多还原

【Abstract】 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.更多还原