A generalization of the Motzkin-Straus theorem to hypergraphs (Q1024737): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolution towards the maximum clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact bounds on the order of the maximum clique of a graph. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new trust region technique for the maximum weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3313888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs do not jump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimizing over a simplex, hypercube or sphere: a short survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the minimization of polynomials of fixed degree over the simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hypergraph extension of Turán's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization approach for solving the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Payoff-Monotonic Game Dynamics and the Maximum Clique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Continuous-Based Approach for Partial Clique Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Eigenvalues of a Graph and Its Chromatic Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral bounds for the clique and independence numbers of graphs / rank
 
Normal rank

Latest revision as of 16:54, 1 July 2024

scientific article
Language Label Description Also known as
English
A generalization of the Motzkin-Straus theorem to hypergraphs
scientific article

    Statements

    A generalization of the Motzkin-Straus theorem to hypergraphs (English)
    0 references
    0 references
    0 references
    17 June 2009
    0 references
    0 references
    maximum clique
    0 references
    polynomial optimization
    0 references
    0 references