Bishnoi, A. (author), Boyadzhiyska, Simona (author), Clemens, Dennis (author), Gupta, Pranshu (author), Lesgourgues, Thomas (author), Liebenau, Anita (author) A graph G is said to be q-Ramsey for a q-tuple of graphs (H<sub>1</sub>,..., H<sub>q</sub>), denoted by G →q (H<sub>1</sub>,..., H<sub>q</sub>), if every q-edge-coloring of G contains a monochromatic copy of Hi in color i for some i ε [q]. Let sq(H1,..., Hq) denote the smallest minimum degree of G over all graphs G that are minimal q-Ramsey...
journal article 2023
