数学科学系

Department of Mathematical Sciences

Embedding Trees in Graphs with Given Size

报告题目: Embedding Trees in Graphs with Given Size

 

报告人:陈耀俊教授(南京大学)

 

时间:20141212日(星期五)16:00--17:00

 

地点:理科楼数学系B203

 

摘要:Let G be a graph on n vertices and k an integer no great than n. When does a graph contain all trees of order k? A folklore lemma says that if G has minimum degree at least k−1, then G contains all trees of order k. Erd?s and Sós conjectured that if the size of G is more than n(k−2)/2, then G contains all trees of order k. Loebl, Komlós and Sós conjectured that if G has at least n/2 vertices of degree at least k−1, then G contains all trees of order k. In this talk, we will discuss the advances on the two conjectures and some planar Ramsey numbers on a complete graph versus trees.

 

报告人简介:陈耀俊,南京大学数学系教授,博士生导师,中国运筹学会第九届理事。20007月在中国科学院数学与系统科学研究院获理学博士学位;2000.7-2002.6在南京大学数学系从事博士后研究工作;2003.9-2005.8在香港理工大学商学院物流系从事博士后研究工作;目前主要从事图中特定子图结构、Ramsey 数以及编码理论、理论计算机与组合图论交叉问题的研究。近几年主持国家自然科学基金四项,在国内外专业学术杂志上发表多篇研究论文,其中近40篇发表在SCI检索源期刊上。

 

联系人:陆玫