István Tomon

activity

20142026

most citedOn the Turán number of some ordered even cycles

10 citations · 38 across the 54 of their papers we have counts for

collaborators

75 papers

math.CO2026

Geometric triangle-free graphs of large chromatic number

István Tomon

We present several geometric constructions of graphs with rapidly growing chromatic numbers, most of which are triangle-free or have large girth.

math.CO2026

Tight bounds for positive discrepancy via eigenvalues

Oliver Janzer, István Tomon, Fredy Yip

Given an $n \times n$ symmetric matrix $M$ with largest eigenvalue $λ_{1} \geq 0$ , it is easy to show that the solution of the optimisation problem $max_{v \in [- 1, 1]^{n}} v^{T} M v$ is at mo…

math.CO2026

Box-Delaunay graphs of large chromatic number

István Tomon

For every $n$ , we construct a 2-dimensional $n$ -element poset whose Hasse diagram has independence number $n exp (- Ω (lo g n))$ , and consequently, chromatic number $\exp(Ω(\sq…

math.CO2026

Discrepancy of geometric incidences

Azem Adibelli, István Tomon

We study the combinatorial (red-blue) discrepancy of finite point sets with respect to hyperplanes and, more generally, bounded-complexity affine algebraic sets. We prove that ever…

math.CO2026

Random 0/1-polytopes expand rapidly

He Guo, István Tomon

A 0/1-polytope is the convex hull of a subset $V \subseteq {0, 1}^{n}$ . A celebrated conjecture of Mihail and Vazirani asserts that the graph of every 0/1-polytope has edge-expansion…

cs.CC2026

Communication Complexity of Disjointness under Product Distributions

Zach Hunter, Aleksa Milojević, Benny Sudakov +1

Determining the randomized (or distributional) communication complexity of disjointness is a central problem in communication complexity, having roots in the foundational work of B…