On multiplicity of triangles (Q308327)

\(M\left(K_3,G\right)\) denotes the minimum number of monochromatic copies of \(K_3\) that must occur in any 2-coloring of the edges of a graph \(G\). If \(k\), \(n\) are positive integers, with \(k\leq\frac n2\), and \(G\) is obtained from \(K_n\) by deleting any \(k\) parallel edges, \(M\left(K_3,G\right)\) has been determined in [\textit{V. Vijayalakshmi}, Ars Comb. 57, 257--284 (2000; Zbl 1064.05065)]. Bounds for another variation of the problem have been determined by the same author in [\textit{V. Vijayalakshmi}, ibid. 85, 341--352 (2007; Zbl 1224.05189)]. In the present paper, the authors consider the case where \(G\) is obtained from the complete graph \(K_{n+\ell}\) by removing the edges of a complete subgraph on \(\ell\) vertices. They apply a technique introduced in [\textit{L. Sauvé}, Am. Math. Mon. 68, 107--111 (1961; Zbl 0101.16702)] to simplify the determination of \(M\left(K_3,K_n\right)\) in [\textit{A. W. Goodman}, Am. Math. Mon. 66, 778--783 (1959; Zbl 0092.01305)].