Strengthening Wilf's lower bound on clique number

Hareshkumar Jadav, Sreekara Madyastha, Rahul Raut +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 bound for the clique number of simple graph…