Ndiamé Ndiaye

most citedThe Speed and Threshold of the Biased Perfect Matching Game

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

collaborators

3 papers

cs.CC2022

On depth-3 circuits and covering number: an explicit counter-example

Lianna Hambardzumyan, Hamed Hatami, Ndiamé Ndiaye

We give a simple construction of $n \times n$ Boolean matrices with $Ω (n^{4/3})$ zero entries that are free of $2 \times 2$ all-zero submatrices and have covering number $O(\log^4(n…

math.CO2020

The Speed and Threshold of the Biased Hamilton Cycle Game

Noah Brustle, Sarah Clusiau, Vishnu V. Narayan +3

We show that there is a constant C such that for any $b < \frac{n}{l n n} - \frac{C n}{( l n n ) ^{3/2}}$ , Maker wins the Maker-Breaker Hamilton cycle game in $n+\frac{Cn}{\sqrt{\ln{n}}}…

math.CO2020★ 1 cited

The Speed and Threshold of the Biased Perfect Matching Game

Noah Brustle, Sarah Clusiau, Vishnu V. Narayan +3

We show that Maker wins the Maker-Breaker perfect matching game in $\frac{n}{2} + o (n)$ turns when the bias is at least $\frac{n}{l o g n} - \frac{f ( n ) n}{( l o g n ) ^{5/4}}$ , for any $f$ …