Miloš Trujić

activity

20182022

most citedThe edge-statistics conjecture for

ℓ ≪ k^{6/5}

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

collaborators

3 papers

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…

cs.DS2020

An Optimal Decentralized $(Δ + 1)$ -Coloring Algorithm

Daniel Bertschinger, Johannes Lengler, Anders Martinsson +4

Consider the following simple coloring algorithm for a graph on $n$ vertices. Each vertex chooses a color from ${1, \dots, Δ (G) + 1}$ uniformly at random. While there exists a c…

math.CO2018★ 5 cited

The edge-statistics conjecture for $ℓ ≪ k^{6/5}$

Anders Martinsson, Frank Mousset, Andreas Noever +1

Let $k$ and $ℓ$ be positive integers. We prove that if $1 \leq ℓ \leq o_{k} (k^{6/5})$ , then in every large enough graph $G$ , the fraction of $k$ -vertex subsets that induce exac…

On the size-Ramsey number of grids

An Optimal Decentralized (Δ+1)-Coloring Algorithm

The edge-statistics conjecture for ℓ≪k6/5

An Optimal Decentralized $(Δ + 1)$ -Coloring Algorithm

The edge-statistics conjecture for $ℓ ≪ k^{6/5}$