Lars Engebretsen, Jonas Holmerin. Towards Optimal Lower Bounds For Clique and Chromatic Number. Electronic Colloquium on Computational Complexity (ECCC), 8(3), 2001. [doi]
@article{ECCC-TR01-003,
title = {Towards Optimal Lower Bounds For Clique and Chromatic Number},
author = {Lars Engebretsen and Jonas Holmerin},
year = {2001},
url = {http://eccc.hpi-web.de/eccc-reports/2001/TR01-003/index.html},
researchr = {https://researchr.org/publication/ECCC-TR01-003},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {8},
number = {3},
}