A note on the clique number of complete $k$-partite graphs
Abstract
In this note, we show that a complete $k$-partite graph is the only graph with clique number $k$ among all degree-equivalent simple graphs. This result gives a lower bound on the clique number, which is sharper than existing bounds on a large family of graphs.
- Publication:
-
arXiv e-prints
- Pub Date:
- July 2015
- DOI:
- 10.48550/arXiv.1507.01613
- arXiv:
- arXiv:1507.01613
- Bibcode:
- 2015arXiv150701613B
- Keywords:
-
- Computer Science - Discrete Mathematics;
- Mathematics - Combinatorics;
- 05C69;
- 05C07;
- G.2.2
- E-Print:
- 6 pages