On Lagrangians of r-uniform hypergraphs
From MaRDI portal
Abstract: A remarkable connection between the order of a maximum clique and the Lagrangian of a graph was established by Motzkin and Straus in [7]. This connection and its extensions were successfully employed in optimization to provide heuristics for the maximum clique number in graphs. It has been also applied in spectral graph theory. Estimating the Lagrangians of hypergraphs has been successfully applied in the course of studying the Turan densities of several hypergraphs as well. It is useful in practice if Motzkin-Straus type results hold for hypergraphs. However, the obvious generalization of Motzkin and Straus' result to hypergraphs is false. We attempt to explore the relationship between the Lagrangian of a hypergraph and the order of its maximum cliques for hypergraphs when the number of edges is in certain range. In this paper, we give some Motzkin-Straus type results for r-uniform hypergraphs. These results generalize and refine a result of Talbot in [19] and a result in [11].
Recommendations
- Model-order reduction ofkth order MIMO dynamical systems using blockkth order Krylov subspaces
- On graph-Lagrangians of hypergraphs containing dense subgraphs
- Some Motzkin-Straus type results for non-uniform hypergraphs
- Maximum cliques of hypergraphs and polynomial optimization
- A Motzkin-Straus type result for 3-uniform hypergraphs
Cites work
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- A Continuous-Based Approach for Partial Clique Enumeration
- A Motzkin-Straus type result for 3-uniform hypergraphs
- A generalization of the Motzkin-Straus theorem to hypergraphs
- A global optimization approach for solving the maximum clique problem
- A hypergraph extension of Turán's theorem
- A new trust region technique for the maximum weight clique problem
- Continuous Characterizations of the Maximum Clique Problem
- Exact bounds on the order of the maximum clique of a graph.
- Extremal problems whose solutions are the blowups of the small Witt- designs
- Hypergraphs do not jump
- Lagrangians of Hypergraphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On finding Lagrangians of 3-uniform hypergraphs.
- Some results on Lagrangians of hypergraphs
- Spectral bounds for the clique and independence numbers of graphs
Cited in
(21)- On finding Lagrangians of 3-uniform hypergraphs.
- Connection between the clique number and the Lagrangian of 3-uniform hypergraphs
- A generalization of the Motzkin-Straus theorem to hypergraphs
- The Hessian matrix of Lagrange function
- Homogeneous multilinear functions on hypergraph cliques
- On cliques and Lagrangians of hypergraphs
- An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
- Maximum cliques of hypergraphs and polynomial optimization
- The eigenvectors to the \(p\)-spectral radius of general hypergraphs
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
- A note on the rationality of \(L\)-functions on finite unoriented graphs
- Model-order reduction ofkth order MIMO dynamical systems using blockkth order Krylov subspaces
- On graph-Lagrangians of hypergraphs containing dense subgraphs
- Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
- The connection between polynomial optimization, maximum cliques and Turán densities
- Some results on Lagrangians of hypergraphs
- On graph-Lagrangians and clique numbers of 3-uniform hypergraphs
- Some Motzkin-Straus type results for non-uniform hypergraphs
- A Motzkin-Straus type result for 3-uniform hypergraphs
- On Motzkin-Straus type results for non-uniform hypergraphs
- Lagrangians of Hypergraphs
This page was built for publication: On Lagrangians of \(r\)-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q498456)
