Nagy Zoltán Lóránt: Outerplanar Turán numbers and number of k-vertex subtrees in binary trees
Nagy Zoltán LórántKombinatorika szeminárium
on 3/18/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.
