Showing 2021Show all
2 papers · 1 filter
math.CO2021
Multicolor Turán numbers
András Imolay, János Karl, Zoltán Lóránt Nagy +1
We consider a natural generalisation of Turán's forbidden subgraph problem and the Ruzsa-Szemerédi problem by studying the maximum number of edge-disjoint copies of a f…
math.CO2021
Clique number of Xor products of Kneser graphs
András Imolay, Anett Kocsis, Ádám Schweitzer
In this article we investigate a problem in graph theory, which has an equivalent reformulation in extremal set theory similar to the problems researched in "A general 2-part Erdős…