期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2019
卷号：16
期号：2
页码：117-124
DOI：10.1016/j.akcej.2018.01.018
语种：English
出版社：Elsevier
摘要：AbstractLet{H(n,m)}be the family of graphs whereH(n,m)is obtained from the complete graphKnby removing the edges ofmvertex disjoint copies of triangles. In this paper, we determine the multiplicity of triangles in any two coloring of the edges ofH(n,m)whenn−3m≥8.
