3 papers
math.CO2026
A note on the Kővári--Sós--Turán theorem for stable hypergraphs
Aris Papadopoulos
In this note, we prove a stronger version of the Kővári-Sós-Turán theorem for partition-wise -stable -hypergraphs. More precisely, we show that for every $k,r\in\mathbb{N}_{\…
math.LO2025
On the global linear Zarankiewicz problem
Pantelis E. Eleftheriou, Aris Papadopoulos
The `global' Zarankiewicz problem for hypergraphs asks for an upper bound on the number of edges of a finite -hypergraph in terms of the number of its vertices, assumi…
math.CO2025
Exact VC-Dimensions of Certain Geometric Set Systems
Pantelis E. Eleftheriou, Aris Papadopoulos, Francis Westhead
The VC-dimension of a family of sets is a measure of its combinatorial complexity used in machine learning theory, computational geometry, and even model theory. Computing the VC-d…