Nemanja Draganić

activity

20172026

most citedSize-Ramsey numbers of graphs with maximum degree three

1 citations · 1 across the 7 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

math.CO2023

Cycles with many chords

Nemanja Draganić, Abhishek Methuku, David Munhá Correia +1

How many edges in an $n$ -vertex graph will force the existence of a cycle with as many chords as it has vertices? Almost 30 years ago, Chen, Erdős and Staton considered this questi…

math.CO2023

Effective bounds for induced size-Ramsey numbers of cycles

Domagoj Bradač, Nemanja Draganić, Benny Sudakov

The induced size-Ramsey number $r^_{ind}^{k} (H)$ of a graph $H$ is the smallest number of edges a (host) graph $G$ can have such that for any $k$ -coloring of its edges, the…