Ruben Ascoli

collaborators

4 papers

math.CO2026

A reformulation of the discrete Convexity Conjecture via $k$ -thresholds

Ruben Ascoli, Xiaoyu He, Jinyoung Park +1

We introduce the notion of " $k$ -thresholds'' and show that Talagrand's discrete convexity conjecture is equivalent to the assertion that, for some universal integer $k \geq 2$ , the…

quant-ph2026

Almost all graphs are vertex-minor universal

Ruben Ascoli, Bryce Frederickson, Sarah Frederickson +2

Answering a question of Claudet, we prove that the uniformly random graph $G \sim G (n, 1/2)$ is $I^c ◯ (n)$ -vertex-minor universal with high probability. That is, for some…

math.CO2026

Rational values of the weak saturation limit

Ruben Ascoli, Xiaoyu He

Given a graph $F$ , a graph $G$ is weakly $F$ -saturated if all non-edges of $G$ can be added in some order so that each new edge introduces a copy of $F$ . The weak saturation number…

math.CO2025

Polynomial-to-exponential transition in 3-uniform Ramsey numbers

Ruben Ascoli, Xiaoyu He, Hung-Hsun Hans Yu

Let $r_{k} (s, e; t)$ denote the smallest $N$ such that any red/blue edge coloring of the complete $k$ -uniform hypergraph on $N$ vertices contains either $e$ red edges among some $s$ …

A reformulation of the discrete Convexity Conjecture via k-thresholds

Almost all graphs are vertex-minor universal

Rational values of the weak saturation limit

Polynomial-to-exponential transition in 3-uniform Ramsey numbers

A reformulation of the discrete Convexity Conjecture via $k$ -thresholds