The prime graph on class sizes of a finite group has a bipartite complement

Let G be a finite group, and let cs(G) denote the set of sizes of the conjugacy classes of G. The prime graph built on cs(G), that we denote by \u394(G), is the (simple undirected) graph whose vertices are the prime divisors of the numbers in cs(G), and two distinct vertices p, q are adjacent if and only if pq divides some number in cs(G). A rephrasing of the main theorem in [8] is that the complement \u394\u203e(G) of the graph \u394(G) does not contain any cycle of length 3. In this paper we generalize this result, showing that \u394\u203e(G) does not contain any cycle of odd length, i.e., it is a bipartite graph. In other words, the vertex set V(G) of \u394(G) is covered by two subsets, each inducing a complete subgraph (a clique). As an immediate consequence, setting \u3c9(G) to be the maximum size of a clique in \u394(G), the inequality |V(G)| 642\u3c9(G) holds for every finite group G