On Motzkin-Straus Type of Results and Frankl-Füredi Conjecture for Hypergraphs

preprint2014arXivOpen access

Abstract

A remarkable connection between the order of a maximum clique and the Graph-Lagrangian of a graph was established by Motzkin and Straus in 1965. This connection and its extension were useful in both combinatorics and optimization. Since then, Graph-Lagrangian has been a useful tool in extremal combinatorics. In this paper, we give a parametrized Graph-Lagrangian for non-uniform hypergraphs and provide several Motzkin-Straus type results for nonuniform hypergraphs which generalize results from [1] and [2]. Another part of the paper concerns a long-standing conjecture of Frankl-Füredi on Graph-Lagrangians of hypergraphs. We show the connection between the Graph-Lagrangian of {1,r1,r2,⋯ ,rl}\{1, r_1, r_2, \cdots, r_l\}-hypergraphs and {r1,r2,⋯ ,rl}\{ r_1, r_2, \cdots, r_l\}-hypergraphs. Some of our results provide solutions to the maximum value of a class of polynomial functions over the standard simplex of the Euclidean space.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.