J. Sahasrabudhe

Most-cited papers

An exponential improvement for diagonal Ramsey
Marcelo Campos, Simon Griffiths, R. Morris, J. Sahasrabudhe
2023116 citations
Semantic Scholar
Upper bounds for multicolour Ramsey numbers
P. Balister, B. Bollobás, Marcelo Campos, Simon Griffiths +4 more
2024Journal of The American Mathematical Society39 citations Open access
Semantic Scholar
Central limit theorems and the geometry of polynomials
Marcus Michelen, J. Sahasrabudhe
2019Journal of the European Mathematical Society (Print)32 citations Open access
Semantic Scholar
Flat Littlewood polynomials exist
P. Balister, B. Bollobás, R. Morris, J. Sahasrabudhe +1 more
2019Annals of Mathematics29 citations Open access
Semantic Scholar
A new lower bound for the Ramsey numbers $R(3,k)$
Marcelo Campos, Matthew Jenssen, Marcus Michelen, J. Sahasrabudhe
202528 citations
Semantic Scholar
The singularity probability of a random symmetric matrix is exponentially small
Marcelo Campos, Matthew Jenssen, Marcus Michelen, J. Sahasrabudhe
2021Journal of The American Mathematical Society28 citations Open access
Semantic Scholar
On the Erdős covering problem: the density of the uncovered set
P. Balister, B. Bollobás, R. Morris, J. Sahasrabudhe +1 more
2021Inventiones Mathematicae27 citations Open access
Semantic Scholar
A new lower bound for sphere packing
Marcelo Campos, Matthew Jenssen, Marcus Michelen, J. Sahasrabudhe
202323 citations
Semantic Scholar
Central limit theorems from the roots of probability generating functions
Marcus Michelen, J. Sahasrabudhe
2018Advances in Mathematics22 citations Open access
Semantic Scholar
Exponential Patterns in Arithmetic Ramsey Theory
J. Sahasrabudhe
201621 citations Open access
Semantic Scholar
On the Maximum Running Time in Graph Bootstrap Percolation
B. Bollobás, Michal Przykucki, O. Riordan, J. Sahasrabudhe
2015Electronic Journal of Combinatorics17 citations Open access
Semantic Scholar
The Erdős–Selfridge problem with square-free moduli
P. Balister, B. Bollobás, R. Morris, J. Sahasrabudhe +1 more
2019Algebra & Number Theory15 citations Open access
Semantic Scholar
Dense subgraphs in random graphs
P. Balister, B. Bollobás, J. Sahasrabudhe, Alexander Veremyev
2018Discrete Applied Mathematics15 citations Open access
Semantic Scholar
On Abelian and Additive Complexity in Infinite Words
Hayri Ardal, T. Brown, Veselin Jungić, J. Sahasrabudhe
2011Integers15 citations Open access
Semantic Scholar
Singularity of random symmetric matrices revisited
Marcelo Campos, Matthew Jenssen, Marcus Michelen, J. Sahasrabudhe
202014 citations Open access
Semantic Scholar
Ramsey Graphs Induce Subgraphs of Many Different Sizes
Bhargav P. Narayanan, J. Sahasrabudhe, István Tomon
2016Combinatorica14 citations Open access
Semantic Scholar
The least singular value of a random symmetric matrix
Marcelo Campos, Matthew Jenssen, Marcus Michelen, J. Sahasrabudhe
2022Forum of Mathematics, Pi13 citations Open access
Semantic Scholar
Counting zeros of cosine polynomials: On a problem of Littlewood
J. Sahasrabudhe
2016Advances in Mathematics13 citations Open access
Semantic Scholar
A stability theorem for maximal Kr+1-free graphs
Kamil Popielarz, J. Sahasrabudhe, Richard Snyder
2016J. Comb. Theory B10 citations Open access
Semantic Scholar
Random polynomials: the closest roots to the unit circle.
Marcus Michelen, J. Sahasrabudhe
20208 citations
Semantic Scholar
Partitioning a graph into monochromatic connected subgraphs
António Girão, Shoham Letzter, J. Sahasrabudhe
2017Journal of Graph Theory8 citations Open access
Semantic Scholar
A Polynomial Improvement for the Odd Cycle–Complete Ramsey Numbers
Marcelo Campos, Matthew Jenssen, Marcus Michelen, Florian Pfender +1 more
2025Combinatorica6 citations Open access
Semantic Scholar
Monochromatic solutions to systems of exponential equations
J. Sahasrabudhe
2016Journal of Combinatorial Theory6 citations Open access
Semantic Scholar
The multicolour size Ramsey number of a path
Csongor Beke, Anqi Li, J. Sahasrabudhe
20255 citations
Semantic Scholar
Cosine polynomials with few zeros
Tomas Juskevicius, J. Sahasrabudhe
2020Bulletin of the London Mathematical Society4 citations Open access
Semantic Scholar
On a New Idiom in the Study of Entailment
R. Jennings, Yue Chen, J. Sahasrabudhe
2011Logica Universalis4 citations
Semantic Scholar
A characterization of polynomials whose high powers have non-negative coefficients
Marcus Michelen, J. Sahasrabudhe
2019Discrete Analysis3 citations Open access
Semantic Scholar
On the Erd\H{o}s Covering Problem: the density of the uncovered set
P. Balister, B. Bollobás, R. Morris, J. Sahasrabudhe +1 more
20183 citations
Semantic Scholar
N T ] 8 N ov 2 01 8 ON THE ERDŐS COVERING PROBLEM : THE DENSITY OF THE UNCOVERED
R. Morris, J. Sahasrabudhe, M. Tiba
20183 citations
Semantic Scholar
The multiplication table problem for bipartite graphs
Bhargav P. Narayanan, J. Sahasrabudhe, István Tomon
2014Combinatorica3 citations
Semantic Scholar
Probabilistic Combinatorics at Exponentially Small Scales
J. Sahasrabudhe
2025Volume 6: Invited Lectures: Sections 12–142 citations Open access
Semantic Scholar
The structure and number of Erdős covering systems
P. Balister, B. Bollobás, R. Morris, J. Sahasrabudhe +1 more
2023Journal of the European Mathematical Society (Print)2 citations Open access
Semantic Scholar
Sturmian Words and Constant Additive Complexity
J. Sahasrabudhe
2015Integers2 citations
Semantic Scholar
Permutations Destroying Arithmetic Structure
Veselin Jungić, J. Sahasrabudhe
2015Electronic Journal of Combinatorics2 citations Open access
Semantic Scholar
Anti-concentration of random variables from zero-free regions
Marcus Michelen, J. Sahasrabudhe
20211 citations
Semantic Scholar
On existentially complete triangle-free graphs
Shoham Letzter, J. Sahasrabudhe
2017Israel Journal of Mathematics1 citations Open access
Semantic Scholar
On the Erd\H{o}s-Rogers function
Robert Morris, J. Sahasrabudhe, Jacques Verstraëte
20260 citations
Semantic Scholar
Erd\H{o}s covering systems
P. Balister, B. Bollobás, R. Morris, J. Sahasrabudhe +1 more
20220 citations
Semantic Scholar
University of Birmingham Singularity of random symmetric matrices revisited
Marcelo Campos, Matthew Jenssen, Marcus Michelen, J. Sahasrabudhe
20210 citations
Semantic Scholar
On existentially complete triangle-free graphs
Shoham Letzter, J. Sahasrabudhe
2020Israel Journal of Mathematics0 citations Open access
Semantic Scholar
Erdős covering systems
P. Balister, B. Bollobás, R. Morris, J. Sahasrabudhe +1 more
2020Acta Mathematica Hungarica0 citations
Semantic Scholar
A ug 2 01 7 On Existentially Complete Triangle-free Graphs
Shoham Letzter, J. Sahasrabudhe
20190 citations
Semantic Scholar
Covering intervals with arithmetic progressions
P. Balister, B. Bollobás, R. Morris, J. Sahasrabudhe +1 more
2019Acta Mathematica Hungarica0 citations
Semantic Scholar
The structure and number of Erd\H{o}s covering systems
P. Balister, B. Bollobás, R. Morris, J. Sahasrabudhe +1 more
20190 citations
Semantic Scholar
C O ] 2 7 M ar 2 01 8 Dense Subgraphs in Random Graphs
P. Balister, B. Bollobás, J. Sahasrabudhe, Alexander Veremyev
20180 citations
Semantic Scholar
AND CONSTANT ADDITIVE COMPLEXITY
J. Sahasrabudhe
20150 citations
Semantic Scholar