15 citations · 53 across the 46 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
Random necklaces require fewer cuts
Noga Alon, Dor Elboim, János Pach +1
It is known that any open necklace with beads of types in which the number of beads of each type is divisible by , can be partitioned by at most cuts into intervals…
math.CO2021
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…