Strahinja Gvozdic

collaborators

3 papers

math.CO2026

Sharp bounds for off-diagonal and tripartite canonical Ramsey numbers

Strahinja Gvozdić, Zach Hunter, Aleksa Milojević +1

The canonical Ramsey theorem establishes that for every positive integer $t$ , there is a sufficiently large $n$ such that every edge-colouring of a complete graph $K_{n}$ contains a…

math.CO2026

Counting thresholds for perfect matchings in hypergraphs

Strahinja Gvozdić

In a $k$ -uniform hypergraph, the minimum $d$ -degree for some $0 \leq d \leq k - 1$ is the minimum number of edges containing any given $d$ -set of vertices. An extension of the classical…

math.CO2025

Seeing is not believing in limited visibility cops and robbers

Bojan Bašić, Alfie Davies, Aleksa Džuklevski +2

We consider the model of limited visibility Cops and Robbers, where the cops can only see within their $l$ -neighbourhood. We prove that the number of cops needed to see the robber…