Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming (Q5001844)

From MaRDI portal
Revision as of 10:04, 8 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 7374442
Language Label Description Also known as
English
Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming
scientific article; zbMATH DE number 7374442

    Statements

    Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 July 2021
    0 references
    semidefinite programming
    0 references
    max cut
    0 references
    extremal combinatorics
    0 references
    \(H\)-free graphs
    0 references

    Identifiers