R. Nenadov

activity

20162026

k

-term arithmetic progressions

2 citations · 5 across the 26 of their papers we have counts for

collaborators

Showing 2022Show all

3 papers · 1 filter

math.CO2022

Routing permutations on spectral expanders via matchings

Rajko Nenadov

We consider the following matching-based routing problem. Initially, each vertex $v$ of a connected graph $G$ is occupied by a pebble which has a unique destination $π (v)$ . In each…

math.CO2022

Probabilistic intuition holds for a class of small subgraph games

Rajko Nenadov

Consider the following two-player game on the edges of $K_{n}$ , the complete graph with $n$ vertices: Starting with an empty graph $G$ on the vertex set of $K_{n}$ , in each round the f…

math.CO2022

On the size-Ramsey number of grids

David Conlon, Rajko Nenadov, Miloš Trujić

We show that the size-Ramsey number of the $n \times n$ grid graph is $O (n^{5/4})$ , improving a previous bound of $n^{3/2 + o (1)}$ by Clemens, Miralaei, Reding, Schac…