Simple congruence lattices of finite graphs (Q1814619)

Let \(G^ c\) be the complement of a graph \(G\). A set \(M\) of edges of \(G^ c\) is called a closed subset of \(G\) if \(M\) is the union of pairwise disjoint induced (by edges) complete subgraphs of \(G^ c\) whose vertices are all of \(V(G)\). It follows that the intersection of an arbitrary family of closed subsets is closed, and the set of all closed subsets of graph \(G\) is a complete semilattice \(H(G)\) with respect to intersection. The concept of congruence lattice is defined, and the congruence lattice is shown to be determined uniquely by the semilattice \(H(G)\). The main result is: The congruence lattice of a graph \(G\) is simple iff \(G^ c\) is not a double star.