5 problems

De Caen–Erdős–Pullman–Wormald conjecture.

Orlin's clique partition conjecture. As $t$ tends to infinity,

Let $G$ be a Cocktail party graph, or the complement of a path or a cycle, on $n$ vertices. Write $\operatorname{cp}(G)$ for the minimum number of cliques in a clique partition of…

For a graph $F$, let $\Delta(F)$ denote its maximum degree, let $\overline{F}$ denote its complement, and let $\operatorname{cp}(G)$ be the minimum number of cliques in a partition…

A clique partition of a graph $G$ is a collection of complete subgraphs that partitions the edge set of $G$, and let $\operatorname{cp}(G)$ be the smallest number of cliques in suc…