10 citations · 38 across the 54 of their papers we have counts for
6 papers · 1 filter
Matrix discrepancy and the log-rank conjecture
Benny Sudakov, István Tomon
Given an binary matrix with (where denotes the number of 1 entries), define the discrepancy of as $\mbox{disc}(M)=\displaystyle\max_{X\sub…
Note on the second eigenvalue of regular graphs
Igor Balla, Eero Räty, Benny Sudakov +1
The goal of this expository note is to give a short, self-contained proof of nearly optimal lower bounds for the second largest eigenvalue of the adjacency matrix of regular graphs…
Positive discrepancy, MaxCut, and eigenvalues of graphs
Eero Räty, Benny Sudakov, István Tomon
The positive discrepancy of a graph of edge density is defined as $$\mbox{disc}^{+}(G)=\max_{U\subset V(G)}e(G[U])-p\binom{|U|}{2}.$$ In 1993, Alon pro…
Dedekind's problem in the hypergrid
Victor Falgas-Ravry, Eero Räty, István Tomon
Consider the partially ordered set on equipped with the natural coordinate-wise ordering. Let denote the number of antichains of this poset. The…
Exponential Erdős-Szekeres theorem for matrices
Recep Altar Çiçeksiz, Zhihan Jin, Eero Räty +1
In 1993, Fishburn and Graham established the following qualitative extension of the classical Erdős-Szekeres theorem. If is sufficiently large with respect to , then any $N\…
Coloring lines and Delaunay graphs with respect to boxes
István Tomon
The goal of this paper is to show the existence (using probabilistic tools) of configurations of lines, boxes, and points with certain interesting combinatorial properties. (i) Fir…