Machine learning and discrete mathematics: a case study in error-correcting codes (in Hungarian)
Turán GyörgyKombinatorika szeminárium
on 10/27/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.
