On the largest graph-Lagrangian of 3-graphs with fixed number of edges
From MaRDI portal
Publication:467468
DOI10.1007/s10957-013-0519-xzbMath1302.05088OpenAlexW2031676594MaRDI QIDQ467468
Cheng Zhao, Qing-song Tang, Yan Ping Sun, Yue Jian Peng
Publication date: 3 November 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0519-x
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Hypergraphs (05C65)
Related Items
On graph-Lagrangians and clique numbers of 3-uniform hypergraphs, A tensor optimization algorithm for computing Lagrangians of hypergraphs, Two extremal problems related to orders, A note on generalized Lagrangians of non-uniform hypergraphs
Uses Software
Cites Work
- On Frankl and Füredi's conjecture for 3-uniform hypergraphs
- On graph-Lagrangians of hypergraphs containing dense subgraphs
- Extremal problems whose solutions are the blowups of the small Witt- designs
- Hypergraphs do not jump
- 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
- Some results on Lagrangians of hypergraphs
- Lagrangians of Hypergraphs
- Continuous Characterizations of the Maximum Clique Problem
- Maxima for Graphs and a New Proof of a Theorem of Turán