Extremal Colorings and Independent Sets

Abstract

We consider several extremal problems of maximizing the number of colorings and independent sets in some graph families with fixed chromatic number and order. First, we address the problem of maximizing the number of colorings in the family of connected graphs with chromatic number k and order n where k >= 4. It was conjectured that extremal graphs are those which have clique number k and size ((k)(2)) + n - k. We affirm this conjecture for 4-chromatic claw-free graphs and for all k-chromatic line graphs with k >= 4. We also reduce this extremal problem to a finite family of graphs when restricted to claw-free graphs. Secondly, we determine the maximum number of independent sets of each size in the family of n-vertex k-chromatic graphs (respectively connected n-vertex k-chromatic graphs and n-vertex k-chromatic graphs with c components). We show that the unique extremal graph is K-k boolean OR En-k, K-1 boolean OR (Kk-1 boolean OR En-k) and (K-1 boolean OR (Kk-1 boolean OR En-k-c+1)) boolean OR Ec-1 respectively.