The character graph of a finite group is perfect

DOI10.1017/S0004972720001240arXiv1907.13292MaRDI QIDQ6322927FDOQ6322927

Authors: Mahdi Ebrahimi 

Publication date: 30 July 2019

Abstract: For a finite group $G$, let $Delta(G)$ denote the character graph built on the set of degrees of the irreducible complex characters of $G$. In graph theory, a perfect graph is a graph $Gamma$ in which the chromatic number of every induced subgraph $Delta$ of $Gamma$ equals the clique number of $Delta$. In this paper, we show that the character graph $Delta(G)$ of a finite group $G$ is always a perfect graph. We also prove that the chromatic number of the complement of $Delta(G)$ is at most three.

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Ordinary representations and characters (20C15) Perfect graphs (05C17)

This page was built for publication: The character graph of a finite group is perfect

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6322927)