Turan problems for infinite graphs

Title:Turan problems for infinite graphs

报告人:天津大学应用数学中心彭兴 

地点:知新楼B1032

时间:4月18上午九点

Abstract:There is a large volume of literature studying Turan type problems of finite graphs. However, the case of infinite graphs is much less known. Motivated by a result of Erdos on the infinite Turan number of increasing paths, we will introduce the infinite Turan number for general graphs and discuss recent progress on this topic. Joint work with Craig Timmons.

个人介绍:彭兴,天津大学应用数学中心副教授,2012年于美国南卡罗莱纳大学取得博士学位,主要研究方向为极值图论、随机图论、图谱理论。在《Journal of Combin. Theory, Ser A.》、《Random Structures and Algorithms》、《Adv. in Appl. Math.》等杂志发表文章。