Lagrangians of hypergraphs II: When colex is best

نویسندگان

چکیده

A well-known conjecture of Frankl and Füredi from 1989 states that an initial segment the colexicographic order has largest Lagrangian any r-uniform hypergraph with m hyperedges. We show this is true when r = 3. also give a new proof related Nikiforov for large t counterexample to old Ahlswede Katona.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lagrangians Of Hypergraphs

How large can the Lagrangian of an r-graph with m edges be? Frankl and Füredi [1] conjectured that the r-graph of size m formed by taking the first m sets in the colex ordering of N(r) has the largest Lagrangian of all r-graphs of size m. We prove the first ‘interesting’ case of this conjecture, namely that the 3-graph with ( t 3 ) edges and largest Lagrangian is [t](3). We also prove that this...

متن کامل

Using Lagrangians of hypergraphs to find non-jumping numbers(II)

Let r ≥ 2 be an integer. A real number α ∈ [0, 1) is a jump for r if for any ε > 0 and any integer m, m ≥ r, any r-uniform graph with n > n0(ε, m) vertices and density at least α + ε contains a subgraph with m vertices and density at least α + c, where c = c(α) does not depend on ε or m. It follows from a result of Erdős, Stone, and Simonovits that every α ∈ [0, 1) is a jump for r = 2. Erdős as...

متن کامل

On Lagrangians of Hypergraphs Containing Dense Subgraphs

Motzkin and Straus established a remarkable connection between the maximum clique and the Lagrangian of a graph in 1965. This connection and its extensions were successfully employed in optimization to provide heuristics for the maximum clique number in graphs. It is useful in practice if similar results hold for hypergraphs. In this paper, we provide upper bounds on the Lagrangian of a hypergr...

متن کامل

When Good Enough Is Best

In this issue of Neuron, Rinberg et al. show that mice use a speed-accuracy tradeoff in odor discrimination. Shorter sampling results in high performance for easy problems, and enforced longer sampling results in higher accuracy for difficult problems, but mice freely choose intermediate sampling durations and accuracy varies with difficulty. Reward value and task requirements may determine sam...

متن کامل

PCT, Spin, Lagrangians, Part II

I promised a second part. Here it is. I hesitated, because I don’t like being destructive, and unfortunately, to deal with the current state of affairs in quantum theory means just doing this: I show you that the current gauge theory is fundamentally ill-designed, along with it fall Weinberg model and Wightman theory. 1. Continuing with the Lagrangian Formalism Let me continue from where I left...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Israel Journal of Mathematics

سال: 2021

ISSN: ['1565-8511', '0021-2172']

DOI: https://doi.org/10.1007/s11856-021-2132-2