István Tomon

collaborators

12 papers

math.CO2026

Explicit constructions of optimal blocking sets and minimal codes

Anurag Bishnoi, IstvÃ¡n Tomon

A strong $s$ -blocking set in a projective space is a set of points that intersects each codimension- $s$ subspace in a spanning set of the subspace. We present an explicit construct…

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…

math.CO2026

Cross-free families have linear size

IstvÃ¡n Tomon

Two subsets $A$ and $B$ of a ground set $X$ are \emph{crossing} if none of the four sets $A ∖ B, B ∖ A, A \cap B, X ∖ (A \cup B)$ are empty. Almost fifty years ago…

math.CO2026

Ramsey theory of low-degree semialgebraic relations

Azem Adibelli, IstvÃ¡n Tomon

We prove that hypergraphs defined by low-degree polynomial inequalities contain large homogeneous subsets. Formally, let $H$ be an $r$ -uniform hypergraph on $N$ vertices that is se…

math.CO2025

From small eigenvalues to large cuts, and Chowla's cosine problem

Zhihan Jin, Aleksa MilojeviÄ, IstvÃ¡n Tomon +1

We prove that every graph with average degree $d$ and smallest adjacency eigenvalue $∣ I^»_{n} ∣ \leq d^{3}$ contains a clique of size $d^{1 - O (I^^{3})}$ . A simple corollary of this yields the…