"MAX k-CUT and approximating the chromatic number of random graphs."

Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani (2006)

> Home

Details and statistics

DOI: 10.1002/RSA.20096

access: closed

type: Journal Article

metadata version: 2022-01-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/Coja-OghlanMS06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/Coja-OghlanMS06
Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani:
MAX k-CUT and approximating the chromatic number of random graphs. Random Struct. Algorithms 28(3): 289-322 (2006)

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.