Author

Strahinja Gvozdic

h-index 1 View on Semantic Scholar

We have 2 of 3 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Sharp bounds for off-diagonal and tripartite canonical Ramsey numbers

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 copy of $K_t$ that is canonically coloured, i.e. monochromatic, rainbow, or lexicographic. In this paper we investigate two variations of th...

Strahinja Gvozdic, Zach Hunter, Aleksa Milojević et al. · 0 citations

Preprint Aug 2026

Counting thresholds for perfect matchings in hypergraphs

In a $k$-uniform hypergraph, the minimum $d$-degree for some $0\le d\le k-1$ is the minimum number of edges containing any given $d$-set of vertices. An extension of the classical Dirac theorem guarantees that whenever the minimum $d$-degree of a $k$-uniform $n$-vertex hypergraph, $k\mid n$, is larger than a certain Di...

Strahinja Gvozdic · 0 citations