Stronger Spectral Bound for Clique Number

Hareshkumar Jadav, Sudipta Mallik, Akhilesh Panchangam +1

Given an integer $k$, deciding whether a graph has a clique of size $k$ is an NP-complete problem. Wilf's inequality provides a spectral lower bound for the clique number of a grap…