On graph-Lagrangians of hypergraphs containing dense subgraphs

DOI10.1007/s10957-013-0485-3zbMath1317.90309arXiv1311.1409MaRDI QIDQ467466

Cheng Zhao, Yue Jian Peng, Qing-song Tang, Xiang-De Zhang

Publication date: 3 November 2014

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.1409

zbMATH Keywords

hypergraphs; maximum clique; polinomial optimization

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C27: Combinatorial optimization

Related Items

Some Motzkin-Straus type results for non-uniform hypergraphs, On Frankl and Füredi's conjecture for 3-uniform hypergraphs, Connection between the clique number and the Lagrangian of 3-uniform hypergraphs, On graph-Lagrangians and clique numbers of 3-uniform hypergraphs, On the largest graph-Lagrangian of 3-graphs with fixed number of edges

Uses Software

• QUALEX

Cites Work

• Unnamed Item
• On Lagrangians of \(r\)-uniform hypergraphs
• Extremal problems whose solutions are the blowups of the small Witt- designs
• 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 Motzkin-Straus type result for 3-uniform hypergraphs
• A new trust region technique for the maximum weight clique problem
• A hypergraph extension of Turán's theorem
• Lagrangians of Hypergraphs
• A global optimization approach for solving the maximum clique problem
• Continuous Characterizations of the Maximum Clique Problem
• A Continuous-Based Approach for Partial Clique Enumeration
• Maxima for Graphs and a New Proof of a Theorem of Turán