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

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. [doi]

@article{Coja-OghlanMS06,
  title = {MAX ::::k::::-CUT and approximating the chromatic number of random graphs},
  author = {Amin Coja-Oghlan and Cristopher Moore and Vishal Sanwalani},
  year = {2006},
  doi = {10.1002/rsa.20096},
  url = {http://dx.doi.org/10.1002/rsa.20096},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Coja-OghlanMS06},
  cites = {0},
  citedby = {0},
  journal = {Random Struct. Algorithms},
  volume = {28},
  number = {3},
  pages = {289-322},
}