研究2-边着色的完全图Kn中单色三角形的最少数目,利用邻接矩阵方法确定了最少数目的精确值.
This paper studied the lower bound for the number of triangles having the same color in any 2-edge-colored complete graph, and found the exact number of such triangles by means of adjacency matrix.