搜索:
 
 当前位置:>首页 -> Events
Turan Type Problems for Bipartite Graphs
·······················································································································································································································································


Speaker:ZHANG Xiaodong,  Shanghai Jiao Tong University;

Time: 2017-03-31 14:30-15:30

Room 1518, School of Mathematical Sciences 



Detail: The (bipartite) Turan number of a graph H, denoted by ex(n, H), is the maximum number of edges in a simple (bipartite) graph of order n which does not contain H as a subgraph. In this talk, we introduce the (bipartite) Turan numbers of forest and some complete bipartite graphs and obtain some exact (bipartite) Turan number of disjoint paths and small complete bipartite graphs.

Moreover, some open problems in this field are included.


Organizer: School of Mathematical Sciences

  网站首页 | 学院概况 | 院系介绍 | 新闻中心 | 师资队伍 | 科学研究 | 人才培养 | 学科建设 | 学生工作 | 研招在线 | 资料下载   2011 中国科学技术大学数学科学学院
站点维护: yangor