Győri Ervin: Hexagon-free planar graphs
Győri ErvinKombinatorika szeminárium
on 4/30/20
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.
