Olivér Janzer: On the Turán number of graphs with minimum degree 3
Janzer OlivérKombinatorika szeminárium
on 11/4/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.
