1 citations · 1 across the 7 of their papers we have counts for
1 paper · 1 filter
Nemanja Draganić, Kalina Petrova
The size-Ramsey number r^(H) of a graph H is the smallest number of edges a (host) graph G can have, such that for any red/blue colouring of G, there is a monochromati…