activity
20182022
most citedDiagonal Ramsey via effective quasirandomness

6 citations · 9 across the 13 of their papers we have counts for

collaborators
Showing math.COShow all

16 papers · 1 filter

math.CO2022

Threshold for Steiner triple systems

Ashwin Sah, Mehtaab Sawhney, Michael Simkin

We prove that with high probability contains a spanning Steiner triple system for , establishing the exponent for the thresho…

math.CO2021

Note on random Latin squares and the triangle removal process

Matthew Kwan, Ashwin Sah, Mehtaab Sawhney

This is a companion note to the paper "Almost all Steiner triple systems have perfect matchings (arXiv:1611.02246). That paper contains several general lemmas about random Steiner…

math.CO2021

Friendly bisections of random graphs

Asaf Ferber, Matthew Kwan, Bhargav Narayanan +2

Resolving a conjecture of Füredi from 1988, we prove that with high probability, the random graph admits a friendly bisection of its vertex set, i.e., a partition of its…

math.CO20213 cited

Majority Dynamics: The Power of One

Ashwin Sah, Mehtaab Sawhney

Consider individuals, where , with individuals holding an opinion and holding an opinion . Suppose that the individuals communicate via an u…

math.CO2021

Anticoncentration versus the number of subset sums

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

Let . We show that for any , if \[\#\{\vecξ \in \{0,1\}^{n}: \langle \vecξ, \vec{w} \rangle = τ\} \ge 2^{-εn}\cdot 2…

math.CO20206 cited

Diagonal Ramsey via effective quasirandomness

Ashwin Sah

We improve the upper bound for diagonal Ramsey numbers to \[R(k+1,k+1)\le\exp(-c(\log k)^2)\binom{2k}{k}\] for . To do so, we build on a quasirandomness and induction frame…