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