2021. 12. 09. 14:15 - 2021. 12. 09. 15:30
Rényi, Nagyterem + Zoom
-
-
-
-
Esemény típusa: szeminárium
Szervezés: Intézeti
-
Kombinatorika szeminárium

Leírás

Abstract: 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.

Az online link:

https://zoom.us/j/2961946869