Some Motzkin-Straus type results for non-uniform hypergraphs
From MaRDI portal
Publication:5963619
Abstract: A remarkable connection between the order of a maximum clique and the Lagrangian of a graph was established by Motzkin and Straus in 1965. This connection and its extensions were applied in Tur'{a}n problems of graphs and uniform hypergraphs. Very recently, the study of Tur'{a}n densities of non-uniform hypergraphs has been motivated by extremal poset problems. In this paper, we give some Motzkin-Straus type results for non-uniform hypergraphs.
Recommendations
- An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
- On Motzkin-Straus type results for non-uniform hypergraphs
- On Lagrangians of \(r\)-uniform hypergraphs
- A Motzkin-Straus type result for 3-uniform hypergraphs
- Maximum cliques of hypergraphs and polynomial optimization
Cites work
- scientific article; zbMATH DE number 4103114 (Why is no real title available?)
- 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 Turán theorem via Lagrangians of intersecting families
- A hypergraph extension of Turán's theorem
- A new trust region technique for the maximum weight clique problem
- A note on the jumping constant conjecture of Erdős
- An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
- Continuous Characterizations of the Maximum Clique Problem
- Evolution towards the maximum clique
- Exact bounds on the order of the maximum clique of a graph.
- Extremal problems whose solutions are the blowups of the small Witt- designs
- Extremals of functions on graphs with applications to graphs and hypergraphs
- Generating non-jumping numbers recursively
- Hypergraphs do not jump
- Lagrangians of Hypergraphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- No four subsets forming an \(N\)
- On families of subsets with a forbidden subposet
- On graph-Lagrangians of hypergraphs containing dense subgraphs
- On substructure densities of hypergraphs
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- Some results on Lagrangians of hypergraphs
- Spectral bounds for the clique and independence numbers of graphs
- Spectral extremal problems for hypergraphs
- Using Lagrangians of hypergraphs to find non-jumping numbers. I
- Using Lagrangians of hypergraphs to find non-jumping numbers. II.
Cited in
(9)- An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
- Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
- The connection between polynomial optimization, maximum cliques and Turán densities
- On Lagrangians of \(r\)-uniform hypergraphs
- A Motzkin-Straus type result for 3-uniform hypergraphs
- A homogeneous polynomial associated with general hypergraphs and its applications
- On Motzkin-Straus type results for non-uniform hypergraphs
- Connection between continuous optimization and Turán densities of non-uniform hypergraphs
- A note on generalized Lagrangians of non-uniform hypergraphs
This page was built for publication: Some Motzkin-Straus type results for non-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963619)
