On the largest graph-Lagrangians of hypergraphs

2013/11/05 by Qingsong Tang, Yuejian Peng, Tang, Qingsong +5 · 2 citations
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.1311.1062

9pages

arxiv created 2014/08/23 · arxiv updated 2014/08/26

Abstract

Frankl and Füredi (1989) conjectured that the r-graph with m edges formed by taking the first m sets in the colex ordering of \mathbb 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.

Cited by

• On Lagrangians of Hypergraphs Containing Dense Subgraphs
• Connection between the clique number and the Lagrangian of 3-uniform hypergraphs

Related

• On Frankl and Furedi's conjecture for 3-uniform hypergraphs
• On hypergraph Lagrangians
• Lagrangians of Hypergraphs II: When colex is best
• Some Results on Lagrangians of Hypergraphs
• On Hypergraph Lagrangians and Frankl-Füredi's Conjecture