3 papers
math.CO2022
Crossing lemma for the odd-crossing number
János Karl, Géza Tóth
A graph is -planar, if it can be drawn in the plane such that there is at most one crossing on every edge. It is known, that -planar graphs have at most edges. We prov…
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
A slightly better bound on the crossing number in terms of the pair-crossing number
János Karl, Géza Tóth
The crossing number of a graph , ${\mbox{cr}}(G)$, is the minimum number of crossings, the pair-crossing number, ${\mbox{pcr}}(G)$, is the minimum number of pairs of crossing ed…