Towards Optimal Lower Bounds For Clique and Chromatic Number

Lars Engebretsen, Jonas Holmerin. Towards Optimal Lower Bounds For Clique and Chromatic Number. Electronic Colloquium on Computational Complexity (ECCC), 8(3), 2001. [doi]

Abstract

Abstract is missing.