1 citations · 3 across the 10 of their papers we have counts for
9 papers · 1 filter
Counting sets with given doubling via dimension
Marcelo Campos, Gabriel Dahia, João Pedro Marciano
We determine, up to a factor of , the number of -sets such that , where and , for small…
Dense sets without large sumsets
Gabriel Dahia, João Pedro Marciano, Victor Souza
We prove, for all fixed , and all sufficiently large , that there exists with such that for all ${A, B \subset \mat…
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…
Colour-bias perfect matchings in hypergraphs
Hiêp Hàn, Richard Lang, João Pedro Marciano +4
We study conditions under which an edge-coloured hypergraph has a particular substructure that contains more than the trivially guaranteed number of monochromatic edges. Our main r…
On the independence number of sparser random Cayley graphs
Marcelo Campos, Gabriel Dahia, João Pedro Marciano
The Cayley sum graph of a set is defined to have vertex set and an edge between two distinct vertices if $x…
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 , then any colouring of the edges of in red and blue contains either a monochromatic red or a monoch…