3 problems

Let $G$ be a co-chordal graph. The Lyu–Hicks conjecture. The biclique partition number satisfies … where $\operatorname{mc}(G^c)$ denotes the number of maximal cliques in the compl…

Let $G=(V,E)$ be a graph, and let $bp(G)$ denote the minimum number of pairwise edge-disjoint complete bipartite subgraphs whose edges partition $E$. Let $\alpha(G)$ be the maximum…

De Caen–Gregory–Pritikin conjecture. For every positive integer $k$,