The Combinatorial Nullstellensatz applied to the Erdős-Faber-Lovász conjecture and other applications in graph theory
Nagy Zoltán LórántKombinatorika szeminárium
on 3/3/22
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.
