学术活动

On some Gallai Ramsey numbers

2019-06-15 08:30

报告人: 陈耀俊

报告人单位: 南京大学

时间: 2019-06-15 8:30-9:20

地点: 卫津路校区6号楼111教

开始时间: 8:30

报告人简介: 南京大学教授

年: 2019

日月: 06.15

A Gallai coloring of a complete graph is an edge-coloring such that no triangle has all its edges colored differently. A Gallaik-coloring is a Gallai coloring that useskcolors. Given a graphHand an integerk≥ 1, the Gallai-Ramsey numberGRk(H) ofHis the least positive integerNsuch that every Gallaik-coloring of the complete graphKNcontains a monochromatic copy ofH. In this report, we will talk about some new results and problems on the Gallai-Ramsey numbers for cycles, complete graphs and complete bipartite graphs.


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