Ruszinkó Miklós: On some Ramsey numbers

We will sketch some old and new results on component, path and cycle Ramsey numbers.
Our new results include ones where the host graph is the complete bipartite graph.
Most of the results are obtained using the 'monochromatic connected matching' method governed by the Szemerédi Regularity Lemma.