Some Motzkin-Straus type results for non-uniform hypergraphs
Combinatorics
2013-11-01 v1
Abstract
A remarkable connection between the order of a maximum clique and the Lagrangian of a graph was established by Motzkin and Straus in 1965. This connection and its extensions were applied in Tur\'{a}n problems of graphs and uniform hypergraphs. Very recently, the study of Tur\'{a}n densities of non-uniform hypergraphs has been motivated by extremal poset problems. In this paper, we give some Motzkin-Straus type results for non-uniform hypergraphs.
Cite
@article{arxiv.1310.8442,
title = {Some Motzkin-Straus type results for non-uniform hypergraphs},
author = {Ran Gu and Xueliang Li and Yuejian Peng and Yongtang Shi},
journal= {arXiv preprint arXiv:1310.8442},
year = {2013}
}
Comments
13 pages