From the 1 of 6 linked papers with an AI index.
6 papers
Dense sets without large sumsets
Gabriel Dahia, João Pedro Marciano, João Pedro Marciano +1
The authors prove that for any fixed density δ, a random δ‑dense subset of {1,…,n} (for sufficiently large n) almost surely avoids containing the sumset A+B of any two subsets A an…
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…
has positive Turán density in the hypercube
Alexandr Grebennikov, João Pedro Marciano
The -dimensional hypercube is a graph with vertex set such that there is an edge between two vertices if and only if they differ in exactly one coordinate. For…
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…
The diameter of randomly twisted hypercubes
Lucas Aragão, MaurÃcio Collares, Gabriel Dahia +1
The -dimensional random twisted hypercube is constructed recursively by taking two instances of , with any joint distribution, and adding a rand…