On hypergraph Lagrangians

Abstract: It is conjectured by Frankl and F"uredi that the

r

-uniform hypergraph with

m

edges formed by taking the first

m

sets in the colex ordering of

{m a t h b b N}^{(r)}

has the largest Lagrangian of all

r

-uniform hypergraphs with

m

edges in cite{FF}. Motzkin and Straus' theorem confirms this conjecture when

r = 2

. For

r = 3

, it is shown by Talbot in cite{T} that this conjecture is true when

m

is in certain ranges. In this paper, we explore the connection between the clique number and Lagrangians for

r

-uniform hypergraphs. As an implication of this connection, we prove that the

r

-uniform hypergraph with

m

edges formed by taking the first

m

sets in the colex ordering of

{m a t h b b N}^{(r)}

has the largest Lagrangian of all

r

-uniform graphs with

t

vertices and

m

edges satisfying

t - 1 c h o o s e r l e q m l e q t - 1 c h o o s e r + t - 2 c h o o s e r - 1 - [(2 r - 6) i m e s 2^{r - 1} + 2^{r - 3} + (r - 4) (2 r - 7) - 1] (t - 2 c h o o s e r - 2 - 1)

for

r g e q 4.

This page was built for publication: On hypergraph Lagrangians