Turan Type Problems for Bipartite Graphs

  • [2017-03-21]


    ZHANG Xiaodong 

    Shanghai Jiao Tong University

    Time: 2017-03-31 14:30-15:30
    Place: Room 1518, School of Mathematical Sciences 


    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



Highlight of USTC

According to the latest Nature Publishing Index (NPI) Asia-Pacific and The Nature Publishing Index China, University of Science and Technology of China tops in Chinese universities again. The rankings are based on the number of papers that were published in Nature journals during the last 12 months.


This article came from News Center of USTC.