3 papers
math.CO2026
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…
math.CO2025
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 $…
math.CO2025
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…