14 citations · 52 across the 41 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
math.CO2023
Universality for graphs with bounded density
Noga Alon, Natalie Dodson, Carmen Jackson +3
A graph is for a (finite) family of graphs if every is a subgraph of . For a given family , the goal is t…
cs.DS2023
Edge-disjoint paths in expanders: online with removals
Nemanja Draganić, Rajko Nenadov
We consider the problem of finding edge-disjoint paths between given pairs of vertices in a sufficiently strong -regular expander graph with vertices. In particular, we…
math.LO2023
A short note on the characterization of countable chains with finite big Ramsey spectra
Keegan Dasilva Barbosa, Dragan Mašulović, Rajko Nenadov
In this short note we confirm the deep structural correspondence between the complexity of a countable scattered chain (= strict linear order) and its big Ramsey combinatorics: we…