2015/07/06 by Boris Brimkov, Brimkov, Boris
Computer Science · Mathematics · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1507.01613
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.