Sharp bounds for covering with large cliques and independent sets

Veronica Bitonti, Emma Hogan, Tommy Walker Mackay

Let $n(k_1,k_2)$ be the least integer $n$ such that there exists a graph on $n$ vertices in which every vertex is contained in both a clique of size $k_1$ and an independent set o…