1 paper
Andrzej Grzesik, Justyna Jaworska, Bartłomiej Kielak +2
A classical Turán problem asks for the maximum possible number of edges in a graph of a given order that does not contain a particular graph H as a subgraph. It is well-known tha…