Minimal circular-imperfect graphs of large clique number and large independence number (Q2427550)

The reviewer of [\textit{X. Zhu}, J. Graph Theory 48, No. 3, 186--209 (2005; Zbl 1071.05037)] has defined the concept of circular perfect succinctly as follows: ``For \(1\leq d\leq k\) let \(K_{k/d}\) be the graph with vertex set \(\{0,\dots,k-1\}\) and edge set \(\{ij: d\leq| i-j| \leq k-d\}\). The circular chromatic number of a graph \(G\) is the minimum of those \(k/d\) for which \(G\) admits a homomorphism to \(K_{k/d}\). The circular clique number \(\omega_c(G)\) is the maximum of those (ratios) \(k/d\) for which \(G\) admits a homomorphism to \(K_{k/d}\). \(G\) is called circular perfect if, for every induced subgraph \(H\) of \(G\) we have \(\chi_c(H)=\omega_c(H)\).'' (\textit{Caveat lector:} in the authors' symbol \(K_{k/d}\) the subscript \(k/d\) represents not a rational, but two distinct integer parameters separated by a slash.) A graph is minimally circularly imperfect [cf. \textit{B. Xu}, Discrete Math.\ 301, No.\ 2--3, 239--242 (2005; Zbl 1078.05035); \textit{A. Pêcher} and \textit{A. K. Wagler}, Discrete Appl. Math. 156, No. 7, 998--1010 (2008; Zbl 1151.05025)] if it is not circular perfect, but each of its proper induced subgraphs is circular perfect. In \S3 the authors construct, for each odd integer \(k\geq3\), a minimal circular-imperfect graph for which the minimum of the independence number and the clique number is \(k+1\).