João Pedro Marciano

most citedA lower bound for set-colouring Ramsey numbers

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2024

Degree conditions for Ramsey goodness of paths

Lucas Aragão, João Pedro Marciano, Walner Mendonça

A classical result of Chvátal implies that if $n \geq (r - 1) (t - 1) + 1$ , then any colouring of the edges of $K_{n}$ in red and blue contains either a monochromatic red $K_{r}$ or a monoch…

cs.CC2023

The complexity of decomposing a graph into a matching and a bounded linear forest

Agnijo Banerjee, João Pedro Marciano, Adva Mond +2

Deciding whether a graph can be edge-decomposed into a matching and a $k$ -bounded linear forest was recently shown by Campbell, H{ö}rsch and Moore to be NP-complete for every $k \g…

math.CO2023★ 1 cited

A lower bound for set-colouring Ramsey numbers

Lucas Aragão, Maurício Collares, João Pedro Marciano +2

The set-colouring Ramsey number $R_{r, s} (k)$ is defined to be the minimum $n$ such that if each edge of the complete graph $K_{n}$ is assigned a set of $s$ colours from $\{1,\ldots,r…