35 citations · 88 across the 11 of their papers we have counts for
13 papers
Disjointness graphs of short polygonal chains
János Pach, Gábor Tardos, Géza Tóth
The {\em disjointness graph} of a set system is a graph whose vertices are the sets, two being connected by an edge if and only if they are disjoint. It is known that the disjointn…
Saturated -planar drawings with few edges
János Barát, Géza Tóth
A drawing of a graph is -plane if every edge contains at most crossings. A -plane drawing is saturated if we cannot add any edge so that the drawing remains -plane. It…
Uncertainty relations with the variance and the quantum Fisher information based on convex decompositions of density matrices
Géza Tóth, Florian Fröwis
We present several inequalities related to the Robertson-Schrödinger uncertainty relation. In all these inequalities, we consider a decomposition of the density matrix into a mixtu…
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…
On the hollow enclosed by convex sets
Jenő Lehel, Géza Tóth
For , a family of compact convex sets in is called an -critical family provided any members of have a non-empty…
Crossings between non-homotopic edges
János Pach, Gábor Tardos, Géza Tóth
We call a multigraph {\em non-homotopic} if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into e…