Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming
- Award ID(s):
- 1814385
- PAR ID:
- 10318346
- Date Published:
- Journal Name:
- SIAM Journal on Discrete Mathematics
- Volume:
- 35
- Issue:
- 3
- ISSN:
- 0895-4801
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1137/20M1333985
