On the largest graph-Lagrangians of hypergraphs

Abstract: Frankl and F"uredi (1989) conjectured that the

r

-graph 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 graph-Lagrangian of all

r

-graphs with

m

edges. In this paper, we establish some bounds for graph-Lagrangians of some special

r

-graphs that support this conjecture.

This page was built for publication: On the largest graph-Lagrangians of hypergraphs