1 citations · 1 across the 1 of their papers we have counts for
3 papers
math.CO2020
Induced Ramsey number for a star versus a fixed graph
Maria Axenovich, Izolda Gorgol
For graphs G and H, let the induced Ramsey number IR(H,G) be the smallest number of vertices in a graph F such that any coloring of the edges of F in red and blue, there is either…
math.CO2018
On induced Ramsey numbers for multiple copies of graphs
Maria Axenovich, Izolda Gorgol
We say that a graph F strongly arrows a pair of graphs (G,H) if any colouring of its edges with red and blue leads to either a red G or a blue H appearing as induced subgraphs of F…
math.CO2017★ 1 cited
A Note on Lower Bounds for Induced Ramsey Numbers
Izolda Gorgol
We say that a graph strongly arrows a pair of graphs if any 2-colouring of its edges with red and blue leads to either a red or a blue appearing as induced subg…