Journal of East China Normal University(Natural Sc ›› 2007, Vol. 2007 ›› Issue (1): 62-64.

• Article • Previous Articles     Next Articles

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

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

CLC Number: