Resolvable Group Divisible Designs and (k,r)-colorings of Complete Graphs
主 题: Resolvable Group Divisible Designs and (k,r)-colorings of Complete Graphs
报告人: Shen Hao (上海交通大学)
时 间: 2013-05-21 15:00 - 16:00
地 点: 理科一号楼1493
A (k,r)-coloring of a complete graph K is a coloring of the edges of K such that all monochromatic connected subgraphs have at most k vertices. The Ramsey number f(k,r) is defined to be the smallest u such that the complete graph with u vertices does not admit a (k,r)-coloring. In this talk, I would like to introduce our recent progresses on the application of resolvable group divisible designs in the study of (k,r)-coloring problem for complete graphs.
