On Motzkin-Straus type results for non-uniform hypergraphs
From MaRDI portal
Publication:2410100
DOI10.1007/s10878-016-0084-yzbMath1406.90123OpenAlexW4246932115MaRDI QIDQ2410100
Cheng Zhao, Qing-song Tang, Xiang-De Zhang, Yue Jian Peng
Publication date: 17 October 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0084-y
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Combinatorial optimization (90C27) Extremal combinatorics (05D99)
Uses Software
Cites Work
- On Lagrangians of \(r\)-uniform hypergraphs
- A note on generalized Lagrangians of non-uniform hypergraphs
- Extremal problems whose solutions are the blowups of the small Witt- designs
- An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
- A generalization of the Motzkin-Straus theorem to hypergraphs
- Hypergraphs do not jump
- 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 new trust region technique for the maximum weight clique problem
- A global optimization approach for solving the maximum clique problem
- Continuous Characterizations of the Maximum Clique Problem
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Some Motzkin-Straus type results for non-uniform hypergraphs
This page was built for publication: On Motzkin-Straus type results for non-uniform hypergraphs
