Simonovits Miklós: How to solve a Turán type extremal graph problem?
Simonovits MiklósKombinatorika szeminárium
on 12/2/21
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.
