Miklós István: Domino tilings, perfect matchings and hardness of computing immanants on restricted matrix classes (in Hungarian)
Miklós IstvánKombinatorika szeminárium
on 5/6/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.
