Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming (Q5001844)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming |
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
23 July 2021
0 references
semidefinite programming
0 references
max cut
0 references
extremal combinatorics
0 references
\(H\)-free graphs
0 references
