4 papers
Off-Diagonal Induced Ramsey Numbers
Bruno Andrades, Marcelo Campos, Rafael Filipe +1
Given graphs and , the induced Ramsey number is the smallest integer for which there exists a graph on vertices such that every red-blue…
Ramsey properties for tilings in random graphs
Lucas Aragão, Xinbu Cheng, Rafael Filipe +3
Let be the graph formed by vertex-disjoint copies of a graph . Let denote that, in any -colouring of the edges of , there exists a monochromatic cop…
A note on the maximum ratio between chromatic number and clique number
Igor Araujo, Rafael Filipe, Rafael Miyazaki
Let be the maximum, over all graphs on vertices, of the ratio , where denotes the chromatic number of and the clique number of $…
An exponential upper bound for induced Ramsey numbers
Lucas Aragão, Marcelo Campos, Gabriel Dahia +2
The induced Ramsey number of a graph is the minimum number such that there exists a graph with vertices for which all -colourings of its edg…