A Motzkin-Straus type result for 3-uniform hypergraphs

DOI10.1007/s00373-012-1135-5zbMath1267.05185OpenAlexW2037348736MaRDI QIDQ2376079

Cheng Zhao, Yue Jian 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

zbMATH Keywords

maximum cliquesLagrangians of \(r\)-uniform hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Connection between the clique number and the Lagrangian of 3-uniform hypergraphs, On graph-Lagrangians and clique numbers of 3-uniform hypergraphs, Unnamed Item, Lagrangian densities of linear forests and Turán numbers of their extensions, On graph-Lagrangians of hypergraphs containing dense subgraphs, On the largest graph-Lagrangian of 3-graphs with fixed number of edges, On Lagrangians of \(r\)-uniform hypergraphs, Dense 3-uniform hypergraphs containing a large clique, A note on generalized Lagrangians of non-uniform hypergraphs, Some Motzkin-Straus type results for non-uniform hypergraphs, Lagrangian densities of enlargements of matchings in hypergraphs, An irrational Turán density via hypergraph Lagrangian densities

Uses Software

• QUALEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Lagrangians of \(r\)-uniform hypergraphs
• Extremal problems whose solutions are the blowups of the small Witt- designs
• Asymptotic solution for a new class of forbidden r-graphs
• A generalization of the Motzkin-Straus theorem to hypergraphs
• Spectral bounds for the clique and independence numbers of graphs
• Hypergraphs do not jump
• Evolution towards the maximum clique
• Exact bounds on the order of the maximum clique of a graph.
• A new trust region technique for the maximum weight clique problem
• A hypergraph extension of Turán's theorem
• 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