10 citations · 38 across the 54 of their papers we have counts for
8 papers · 1 filter
Colorings with only rainbow arithmetic progressions
János Pach, István Tomon
If we want to color with the property that all 3-term arithmetic progressions are rainbow (that is, their elements receive 3 distinct colors), then, obviously, we ne…
Uniform chain decompositions and applications
Benny Sudakov, Istvan Tomon, Adam Zsolt Wagner
The Boolean lattice is the family of all subsets of ordered by inclusion, and a chain is a family of pairwise comparable elements of . Let $s…
Turán number of bipartite graphs with no
Benny Sudakov, István Tomon
The extremal number of a graph , denoted by $\mbox{ex}(n,H)$, is the maximum number of edges in a graph on vertices that does not contain . The celebrated Kővári-Sós-Turá…
Coloring Hasse diagrams and disjointness graphs of curves
Janos Pach, Istvan Tomon
Given a family of curves in the plane, its disjointness graph is the graph whose vertices correspond to the elements of , and two vertices are joined by…
A sharp threshold phenomenon in string graphs
Istvan Tomon
We prove that for every there exists such that the following holds. Let be a collection of curves in the plane such that there are at most $(\frac{1}{…
Bipartite Turán problems for ordered graphs
Abhishek Methuku, István Tomon
A zero-one matrix contains a zero-one matrix if one can delete some rows and columns of , and turn some 1-entries into 0-entries such that the resulting matrix is . T…