1 citations · 1 across the 7 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.CO2020
Rolling backwards can move you forward: on embedding problems in sparse expanders
Nemanja Draganić, Michael Krivelevich, Rajko Nenadov
We develop a general embedding method based on the Friedman-Pippenger tree embedding technique (1987) and its algorithmic version, essentially due to Aggarwal et al. (1996), enhanc…
math.CO2020
The size-Ramsey number of short subdivisions
Nemanja Draganić, Michael Krivelevich, Rajko Nenadov
The -size-Ramsey number of a graph is the smallest number of edges a graph can have, such that for every edge-coloring of with colors there exists…