Multiplicity of triangles in complete graphs with K3-holes
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.
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-08-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S097286001730066X |