Turán problem for oriented graphs

Description of video

Date: 12/9/21
Speaker :Grzesik Andrzej


    Turán problem asks for the biggest possible number of edges
    in a graph not containing a given graph as a subgraph. In the talk we
    will survey known results and present new developments regarding this
    problem in the setting of oriented graphs.