"Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming."

Charles Carlson et al. (2021)

> Home

Details and statistics

DOI: 10.1137/20M1333985

access: closed

type: Journal Article

metadata version: 2022-11-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamdm/CarlsonKLMST21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/CarlsonKLMST21
Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan:
Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming. SIAM J. Discret. Math. 35(3): 1557-1568 (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.