10 citations · 38 across the 54 of their papers we have counts for
8 papers · 1 filter
Lower bounds for piercing and coloring boxes
István Tomon
Given a family of axis-parallel boxes in , let denote its piercing number, and its independence number. It is an old question whether can…
Regular subgraphs of linear hypergraphs
Oliver Janzer, Benny Sudakov, István Tomon
We prove that the maximum number of edges in a 3-uniform linear hypergraph on vertices containing no 2-regular subhypergraph is . This resolves a conjecture of Dell…
Ramsey numbers of semi-algebraic and semi-linear hypergraphs
Zhihan Jin, István Tomon
An -uniform hypergraph is semi-algebraic of complexity if the vertices of correspond to points in , and the edges of are determi…
Evasive sets, covering by subspaces, and point-hyperplane incidences
Benny Sudakov, István Tomon
Given positive integers and a finite field , a set is -subspace evasive if every -dimensional affine subspace contains at m…
Small subgraphs with large average degree
Oliver Janzer, Benny Sudakov, István Tomon
In this paper we study the fundamental problem of finding small dense subgraphs in a given graph. For a real number , we prove that every graph on vertices with average de…
Irredundant hyperplane covers
János Nagy, Péter Pál Pach, István Tomon
We prove that if is an abelian group and is an irredundant (minimal) cover of with cosets, then This bound…
The Turán number of the grid
Domagoj Bradač, Oliver Janzer, Benny Sudakov +1
For a positive integer , let denote the graph of the grid. Motivated by a 50-year-old conjecture of Erdős about Turán numbers of -degenerate graphs, we prov…
Robust (rainbow) subdivisions and simplicial cycles
István Tomon
We present several results in extremal graph and hypergraph theory of topological nature. First, we show that if and is an odd integer, then…