Strongly perfect infinite graphs (Q1895072)

A graph is perfect if the chromatic number of each induced subgraph \(H\) of \(G\) equals the size of the largest clique in \(H\). A graph \(G\) is called strongly perfect if each induced subgraph \(H\) of \(G\) has a vertex coloring \(\{C_i: i\in I\}\) such that some clique of \(H\) intersects all \(C_i\). It has been conjectured that a perfect graph with no infinite independent set is strongly perfect. This paper proves the conjecture for chordal graphs (in which every circuit of length \(\geq 4\) has a chord) and their complements.