Some Motzkin-Straus type results for non-uniform hypergraphs
From MaRDI portal
Publication:5963619
DOI10.1007/S10878-014-9736-YzbMATH Open1331.05161arXiv1310.8442OpenAlexW1999263280MaRDI QIDQ5963619FDOQ5963619
Yuejian Peng, Ran Gu, Yongtang Shi, Xueliang Li
Publication date: 23 February 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1310.8442
Recommendations
- An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
- On Motzkin-Straus type results for non-uniform hypergraphs
- On Lagrangians of \(r\)-uniform hypergraphs
- A Motzkin-Straus type result for 3-uniform hypergraphs
- Maximum cliques of hypergraphs and polynomial optimization
Cites Work
- Using Lagrangians of hypergraphs to find non-jumping numbers. I
- Hypergraphs do not jump
- A note on the jumping constant conjecture of Erdős
- Using Lagrangians of hypergraphs to find non-jumping numbers. II.
- Generating non-jumping numbers recursively
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- Title not available (Why is that?)
- A generalization of the Motzkin-Straus theorem to hypergraphs
- A Motzkin-Straus type result for 3-uniform hypergraphs
- A hypergraph extension of Turán's theorem
- Some results on Lagrangians of hypergraphs
- Lagrangians of Hypergraphs
- On graph-Lagrangians of hypergraphs containing dense subgraphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Extremal problems whose solutions are the blowups of the small Witt- designs
- Evolution towards the maximum clique
- Continuous Characterizations of the Maximum Clique Problem
- A new trust region technique for the maximum weight clique problem
- Spectral Extremal Problems for Hypergraphs
- A hypergraph Turán theorem via Lagrangians of intersecting families
- A Continuous-Based Approach for Partial Clique Enumeration
- Spectral bounds for the clique and independence numbers of graphs
- No four subsets forming an \(N\)
- On Families of Subsets With a Forbidden Subposet
- On substructure densities of hypergraphs
- Extremals of functions on graphs with applications to graphs and hypergraphs
- Exact bounds on the order of the maximum clique of a graph.
- A global optimization approach for solving the maximum clique problem
- Title not available (Why is that?)
- An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
Cited In (5)
- The connection between polynomial optimization, maximum cliques and Turán densities
- A homogeneous polynomial associated with general hypergraphs and its applications
- On Motzkin-Straus type results for non-uniform hypergraphs
- Connection between continuous optimization and Turán densities of non-uniform hypergraphs
- A note on generalized Lagrangians of non-uniform hypergraphs
Uses Software
This page was built for publication: Some Motzkin-Straus type results for non-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963619)
