Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
type: Item
instance of: scholarly article
title: Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
zbMATH Open document ID: 1404.05135
author: Pingge Chen
author: Yuejian Peng
published in: Order
publication date: 2018-07-27T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6911230
zbMATH Keywords: maximum clique
zbMATH Keywords: polynomial optimization
zbMATH Keywords: Turán density
MaRDI profile type: Publication
full work available at URL: s11083-017-9434-3
OpenAlex ID: W2731233561
cites work: Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
cites work: Extremal problems whose solutions are the blowups of the small Witt- designs
cites work: A hypergraph Turán theorem via Lagrangians of intersecting families
cites work: Turán problems on non-uniform hypergraphs
cites work: Q5512796
cites work: Q3089368
cites work: Non-uniform Turán-type problems
cites work: Q3688092
cites work: Maxima for Graphs and a New Proof of a Theorem of Turán
cites work: An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
cites work: A generalization of the Motzkin-Straus theorem to hypergraphs
cites work: Lagrangians of Hypergraphs
cites work: The connection between polynomial optimization, maximum cliques and Turán densities
DOI: 10.1007/S11083-017-9434-3
description: scientific article; zbMATH DE number 6911230