5 citations · 9 across the 19 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.CO2021
Tight bounds for divisible subdivisions
Shagnik Das, Nemanja Draganić, Raphael Steiner
Alon and Krivelevich proved that for every -vertex subcubic graph and every integer there exists a (smallest) integer such that every -minor contai…
math.CO2021
Ramsey number of 1-subdivisions of transitive tournaments
Nemanja Draganić, David Munhá Correia, Benny Sudakov +1
The study of problems concerning subdivisions of graphs has a rich history in extremal combinatorics. Confirming a conjecture of Burr and Erdős, Alon proved in 1994 that subdivided…
math.CO2021
Short proofs for long induced paths
Nemanja Draganić, Stefan Glock, Michael Krivelevich
We present a modification of the Depth first search algorithm, suited for finding long induced paths. We use it to give simple proofs of the following results. We show that the ind…