R. Nenadov

activity

20092026

most citedOn the number of graphs without large cliques

14 citations · 52 across the 41 of their papers we have counts for

collaborators

Showing 2026Show all

4 papers · 1 filter

math.CO2026

Probabilistic and game thresholds

Rajko Nenadov

Let $X$ be a finite set and $F \subseteq 2^{X}$ a non-trivial increasing property. We show that the bias-threshold $b (F)$ for the Picker-Chooser $F$ -gam…

math.CO2026

Poset dimension and maximum comparability degree

Carla Groenland, Richard Montgomery, Rajko Nenadov +1

In 1986, Füredi and Kahn showed that the dimension $dim (P)$ of any finite poset $P$ satisfies $dim (P) = O (d lo g^{2} d)$ , where $d$ is the maximum degree of the comparability graph…

math.CO2026

The typical structure of sets with large sumset

Rajko Nenadov, Lander Verlinde

Given $m \in N$ and a $p$ -random subset $A \subseteq N$ , we asymptotically determine $lo g Pr (∣ N ∖ (A + A) ∣ \geq m)$ for $p$ above the threshold…

math.PR2026

The critical activation density in graph bootstrap percolation

Brett Kolesnik, Tamás Makai, Rajko Nenadov +3

In graph bootstrap percolation, edges of an Erdős-Rényi random graph $G_{n, p}$ are initially active, and activation spreads to other edges of $K_{n}$ via the combinatorics…