Multiplicity of triangles in complete graphs with K3-holes

Abstract

Let {H(n,m)}be the family of graphs where H(n,m)is obtained from the complete graph Knby removing the edges of m vertex disjoint copies of triangles. In this paper, we determine the multiplicity of triangles in any two coloring of the edges of H(n,m)when n−3m≥8.