华东师范大学学报(自然科学版) ›› 2007, Vol. 2007 ›› Issue (1): 62-64.

• 数学 • 上一篇    下一篇

2-边着色图中的单色三角形

张燕, 任 韩   

  1. 华东师范大学 数学系, 上海 200062
  • 收稿日期:2005-01-10 修回日期:2005-04-27 出版日期:2007-01-25 发布日期:2007-01-25
  • 通讯作者: 任韩

Number of 0-1 Triangles in Edge-Coloring of Complete Graphs(Chinese)

ZHANG Yan, REN Han   

  1. Department of Mathematics\,,East China Normal University, Shanghai 200062, China
  • Received:2005-01-10 Revised:2005-04-27 Online:2007-01-25 Published:2007-01-25
  • Contact: REN Han

摘要： 研究2-边着色的完全图Kn中单色三角形的最少数目, 利用邻接矩阵方法确定了最少数目的精确值.

关键词: 2-边着色, 单色三角形, t-数, 2-边着色, 单色三角形, t-数

Abstract: 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.

Key words: 0-1 triangles, t-number, 2-edge coloring, 0-1 triangles, t-number

中图分类号: