Humberto Naves

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

collaborators

2 papers

math.CO2017★ 3 cited

Making spanning graphs

Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +2

We prove that for each $D \geq 2$ there exists $c > 0$ such that whenever $b \leq c (\frac{n}{l o g n})^{1/ D}$ , in the $(1 : b)$ Maker-Breaker game played on $E (K_{n})$ , Maker has a s…

math.CO2013★ 1 cited

Discrepancy of random graphs and hypergraphs

Jie Ma, Humberto Naves, Benny Sudakov

Answering in a strong form a question posed by Bollobás and Scott, in this paper we determine the discrepancy between two random k-uniform hypergraphs, up to a constant factor depe…