On the Triangle Clique Cover and $K_t$ Clique Cover Problems

TL;DR

This paper extends classical results on edge clique covers to $K_t$ clique covers for all $t \, \geq \, 1$, providing new bounds, algorithms, and complexity results for these generalized problems.

Contribution

It generalizes the edge clique cover concept to $K_t$ clique covers, extends classical bounds to $t=3$, and proves NP-hardness for the problem.

Findings

Upper bound for $K_3$ clique cover number matches Turán graph $T(n,3)$

Extended an algorithm for weighted $K_t$ clique cover on chordal graphs

Proved $K_t$ clique cover problem is NP-hard

Abstract

An edge clique cover of a graph is a set of cliques that covers all edges of the graph. We generalize this concept to "$K_t$ clique cover", i.e. a set of cliques that covers all complete subgraphs on $t$ vertices of the graph, for every $t \geq 1$. In particular, we extend a classical result of Erd\"os, Goodman, and P\'osa (1966) on the edge clique cover number ($t = 2$), also known as the intersection number, to the case $t = 3$. The upper bound is tight, with equality holding only for the Tur\'an graph $T(n,3)$. We also extend an algorithm of Scheinerman and Trenk (1999) to solve a weighted version of the $K_t$ clique cover problem on a superclass of chordal graphs. We also prove that the $K_t$ clique cover problem is NP-hard.