10 citations · 38 across the 54 of their papers we have counts for
8 papers · 1 filter
Additive bases, coset covers, and non-vanishing linear maps
János Nagy, Péter Pál Pach, István Tomon
Recently, the first two authors proved the Alon-Jaeger-Tarsi conjecture on non-vanishing linear maps, for large primes. We extend their ideas to address several other related conje…
Polynomial removal lemmas for ordered graphs
Lior Gishboliner, István Tomon
A recent result of Alon, Ben-Eliezer and Fischer establishes an induced removal lemma for ordered graphs. That is, if is an ordered graph and , then there exists…
On -graphs with no four vertices spanning exactly two edges
Lior Gishboliner, István Tomon
Let denote the -uniform hypergraph with vertices and edges. Answering a question of Alon and Shapira, we prove an induced removal lemma for having polynomial…
Ramsey properties of algebraic graphs and hypergraphs
Benny Sudakov, István Tomon
One of the central questions in Ramsey theory asks how small can be the size of the largest clique and independent set in a graph on vertices. By the celebrated result of Erdős…
Flattening rank and its combinatorial applications
David Munhá Correia, Benny Sudakov, István Tomon
Given a -dimensional tensor (where is a field), the -flattening rank of is the rank of the matrix whose ro…
Small doubling, atomic structure and -divisible set families
Lior Gishboliner, Benny Sudakov, István Tomon
Let be a set family such that the intersection of any two members of has size divisible by . The famous Eventown theorem states tha…