1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.CO2023★ 1 cited
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…
math.CO2023
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…