On Lagrangians of \(r\)-uniform hypergraphs
From MaRDI portal
Publication:498456
DOI10.1007/s10878-013-9671-3zbMath1332.90330arXiv1212.2795OpenAlexW2068939338MaRDI QIDQ498456
Cheng Zhao, Qing-song Tang, Yue Jian Peng
Publication date: 28 September 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.2795
Related Items (8)
Connection between the clique number and the Lagrangian of 3-uniform hypergraphs ⋮ A Motzkin-Straus type result for 3-uniform hypergraphs ⋮ Some results on Lagrangians of hypergraphs ⋮ On graph-Lagrangians and clique numbers of 3-uniform hypergraphs ⋮ Unnamed Item ⋮ On Motzkin-Straus type results for non-uniform hypergraphs ⋮ The eigenvectors to the \(p\)-spectral radius of general hypergraphs ⋮ On graph-Lagrangians of hypergraphs containing dense subgraphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Extremal problems whose solutions are the blowups of the small Witt- designs
- A generalization of the Motzkin-Straus theorem to hypergraphs
- Spectral bounds for the clique and independence numbers of graphs
- Hypergraphs do not jump
- 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
- Some results on Lagrangians of hypergraphs
- 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
This page was built for publication: On Lagrangians of \(r\)-uniform hypergraphs
