2 citations · 6 across the 7 of their papers we have counts for
1 paper · 1 filter
Boris Brimkov
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 c…