Solution to a problem of Katona on counting cliques of weighted graphs

Peter Borg, Carl Feghali, Rémi Pellerin

A subset $I$ of the vertex set $V(G)$ of a graph $G$ is called a $k$-clique independent set of $G$ if no $k$ vertices in $I$ form a $k$-clique of $G$. An independent set is a $2$-c…