A graph for which the inertia bound is not tight
- 172 Downloads
The inertia bound gives an upper bound on the independence number of a graph by considering the inertia of matrices corresponding to the graph. The bound is known to be tight for graphs on 10 or fewer vertices as well as for all perfect graphs. It is natural to question whether the bound is always tight. We show that the bound is not tight for the Paley graph on 17 vertices as well as its induced subgraph on 16 vertices.