Seminars_raw

Anti-Ramsey numbers of graphs with some decomposition family sequences

2018-12-24 00:00

Speaker: Dr. Longtu YUAN

unit:

Time: 2018-12-28 16:00-17:00

Venue: The Wei Jin Road No. 6 Building 111 campus teaching

starttime: 2018-12-28 16:00-17:00

Profile:


Theme:
Anti-Ramsey numbers of graphs with some decomposition family sequences
Time:
2018-12-28 16:00-17:00
Venue:
The Wei Jin Road No. 6 Building 111 campus teaching
Speaker:
Dr. Longtu YUAN

Abstract

       For a given graph H, the anti-Ramsey number of H is the maximum number of colors in an edge-coloring of a complete graph which does not contain a rainbow copy of H. In this paper, we extend the decomposition family of graphs to the decomposition family sequence of graphs and show that K5 is determined by its decomposition family sequence. Based on this new graph notation, we determine the anti-Ramsey numbers for new families of graphs, including the Petersen graph, vertex-disjoint union of cliques, etc., and characterize the extremal colorings.


Contact us

Add:Building 58, The School of Mathematics, Tianjin University Beiyangyuan Campus,

        No. 135, Ya Guan Road, Jinnan District, Tianjin, PRC 

Tel:022-60787827   Mail:math@tju.edu.cn