Abstract
In this note, we show that a complete -partite graph is the only graph with clique number 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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.