A Motzkin-Straus type result for 3-uniform hypergraphs
DOI10.1007/S00373-012-1135-5zbMATH Open1267.05185OpenAlexW2037348736MaRDI QIDQ2376079FDOQ2376079
Authors: Cheng Zhao, Yuejian Peng 
Publication date: 26 June 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1135-5
Recommendations
- Some Motzkin-Straus type results for non-uniform hypergraphs
- Connection between the clique number and the Lagrangian of 3-uniform hypergraphs
- On Lagrangians of \(r\)-uniform hypergraphs
- A generalization of the Motzkin-Straus theorem to hypergraphs
- On graph-Lagrangians and clique numbers of 3-uniform hypergraphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65)
Cites Work
- Hypergraphs do not jump
- Nonlinear optimization.
- Title not available (Why is that?)
- A generalization of the Motzkin-Straus theorem to hypergraphs
- A hypergraph extension of Turán's theorem
- On finding Lagrangians of 3-uniform hypergraphs.
- Lagrangians of Hypergraphs
- On Lagrangians of \(r\)-uniform hypergraphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Extremal problems whose solutions are the blowups of the small Witt- designs
- Asymptotic solution for a new class of forbidden r-graphs
- Evolution towards the maximum clique
- Continuous Characterizations of the Maximum Clique Problem
- A new trust region technique for the maximum weight clique problem
- A Continuous-Based Approach for Partial Clique Enumeration
- Spectral bounds for the clique and independence numbers of graphs
- Exact bounds on the order of the maximum clique of a graph.
- A global optimization approach for solving the maximum clique problem
Cited In (19)
- Some Motzkin-Straus type results for non-uniform hypergraphs
- Connection between the clique number and the Lagrangian of 3-uniform hypergraphs
- Dense 3-uniform hypergraphs containing a large clique
- On graph-Lagrangians of hypergraphs containing dense subgraphs
- On Lagrangians of \(r\)-uniform hypergraphs
- A generalization of the Motzkin-Straus theorem to hypergraphs
- Lagrangian densities of linear forests and Turán numbers of their extensions
- A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs
- Lagrangian densities of enlargements of matchings in hypergraphs
- An irrational Turán density via hypergraph Lagrangian densities
- On graph-Lagrangians and clique numbers of 3-uniform hypergraphs
- On the largest graph-Lagrangian of 3-graphs with fixed number of edges
- Title not available (Why is that?)
- The lifting of graphs to 3-uniform hypergraphs and some applications to hypergraph Ramsey theory
- On cliques and Lagrangians of hypergraphs
- On Motzkin-Straus type results for non-uniform hypergraphs
- On the Erdős-Hajnal problem for 3-uniform hypergraphs
- Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive
- A note on generalized Lagrangians of non-uniform hypergraphs
Uses Software
This page was built for publication: A Motzkin-Straus type result for 3-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376079)
