Speaker：ZHANG Xiaodong， Shanghai Jiao Tong University;
Time: 20170331 14:3015: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
