A note on the clique number of complete k-partite graphs
classification
💻 cs.DM
math.CO
keywords
cliquegraphsnumbercompletegraphnotepartitebound
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.