报告题目：Turan Type Problems for Bipartite Graphs

报告人： 张晓东 上海交通大学

报告时间：3月31日  2:30-3:30

地点：1518

摘要：

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.