G. O. Mota

collaborators

4 papers

math.CO2026

A canonical Ramsey theorem for even cycles in random graphs

JosÃ© D. Alvarado, Y. Kohayakawa, Patrick Morris +1

The celebrated canonical Ramsey theorem of ErdÅs and Rado implies that for $2 \leq k \in N$ , any colouring of the edges of $K_{n}$ with $n$ sufficiently large gives a copy of…

math.CO2026

A sparse canonical van der Waerden theorem

JosÃ© D. Alvarado, Yoshiharu Kohayakawa, Patrick Morris +2

The canonical van der Waerden theorem asserts that, for sufficiently large $n$ , every colouring of $[n]$ contains either a monochromatic or a rainbow arithmetic progression of leng…

math.CO2026

A canonical Ramsey theorem with list constraints in random (hyper-)graphs

The celebrated canonical Ramsey theorem of ErdÅs and Rado implies that for a given $k$ -uniform hypergraph (or $k$ -graph) $H$ , if $n$ is sufficiently large then any colouring of th…

math.CO2025

Graphs with asymmetric Ramsey properties

Walner MendonÃ§a, Meysam Miralaei, Guilherme O. Mota

Given positive integers $k$ and $ℓ$ we write $G \to (K_{k}, K_{ℓ})$ if every 2-colouring of the edges of $G$ yields a red copy of $K_{k}$ or a blue copy of $K_{ℓ}$ and we d…