1 problem

Let $G$ be a finite graph. Write $\ker(G)$ for its kernel, $\diadem(G)$ for its diadem, and $\alpha(G)$ for its independence number. Kernel–diadem conjecture. For every graph $G$,…