Pedro Araújo

activity

20202026

most citedCounting graph orientations with no directed triangles

5 citations · 6 across the 4 of their papers we have counts for

collaborators

6 papers

math.CO2026

A rainbow version of Lehel's conjecture

Pedro Araújo, Xiao-Chuan Liu, Taísa Martins +4

Lehel's conjecture states that every 2-edge-colouring of K_n admits a partition of its vertex set into two monochromatic cycles. It was proven for sufficiently large n by Łuczak, R…

math.CO2022

Ramsey numbers of cycles in random graphs

Pedro Araújo, Matías Pavez-Signé, Nicolás Sanhueza-Matamala

Let $R (C_{n})$ be the Ramsey number of the cycle on $n$ vertices. We prove that, for some $C > 0$ , with high probability every $2$ -colouring of the edges of $G (N, p)$ has a monochroma…

math.CO2022★ 1 cited

Prominent examples of flip processes

Pedro Araújo, Jan Hladký, Eng Keat Hng +1

Flip processes, introduced in [Garbe, Hladký, Šileikis, Skerman: From flip processes to dynamical systems on graphons], are a class of random graph processes defined using a rule w…

math.CO2022

On the anti-Ramsey threshold for non-balanced graphs

Pedro Araújo, Taísa Martins, Letícia Mattos +3

For graphs $G$ and $H$ , we write $G ⟶ rb H$ if any proper edge-coloring of $G$ contains a rainbow copy of $H$ , i.e., a copy where no color appear…

math.CO2020★ 5 cited

Counting graph orientations with no directed triangles

Pedro Araújo, Fábio Botler, Guilherme Oliveira Mota

Alon and Yuster proved that the number of orientations of any $n$ -vertex graph in which every $K_{3}$ is transitively oriented is at most $2^{⌊ n^{2} /4 ⌋}$ for $n \geq 1 0^{4}$ …

math.CO2020

Ramsey goodness of trees in random graphs

Pedro Araújo, Luiz Moreira, Matías Pavez-Signé

For a graph $G$ , we write $G \to (K_{r + 1}, T (n, D))$ if every blue-red colouring of the edges of $G$ contains either a blue copy of $K_{r + 1}$ , or a red copy…