Title: The Turan Numbers for Linear Forests
Speaker: Xiaodong Zhang
Affiliation: Shanghai Jiao Tong University
Time: 2018-12-16 13：30-15：30
Venue: Room 201 Lecture Hall
abstract：The Tur´an number of a graph H, 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 how to determine the exact value ex(n; H) when H is linear forest, i.e.,the union of disjoint paths and characterize all extremal graphs. Moreover, some problems are included.
