Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming (Q5001844): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1810.10044 / rank | |||
Normal rank | |||
Revision as of 21:29, 19 April 2024
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
