Multiplicity of triangles in complete graphs with -holes
Let be the family of graphs where is obtained from the complete graph by removing the edges of vertex disjoint copies of triangles. In this paper, we determine the multiplicity of triangles in any two coloring of the edges of when .
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-08-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2018.01.018 |