Füredi Zoltán: Monochromatic components in almost complete graphs (in Hungarian)
Füredi ZoltánKombinatorika szeminárium
on 4/29/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.
