Julian Sahasrabudhe | Department of Pure Mathematics and Mathematical Statistics

skip to content

Research Interests:

Publications

Central limit theorems from the roots of probability generating functions

M Michelen, J Sahasrabudhe

– Advances in Mathematics

(2019)

358,

106840

(DOI: 10.1016/j.aim.2019.106840)

Dense subgraphs in random graphs

P Balister, B Bollobás, J Sahasrabudhe, A Veremyev

– Discrete Applied Mathematics

(2019)

260,

66

(DOI: 10.1016/j.dam.2019.01.032)

Counting zeros of cosine polynomials: On a problem of Littlewood

J Sahasrabudhe

– Advances in Mathematics

(2018)

343,

495

(DOI: 10.1016/j.aim.2018.11.025)

Partitioning a graph into monochromatic connected subgraphs

A Girão, S Letzter, J Sahasrabudhe

– Journal of Graph Theory

(2018)

91,

353

(DOI: 10.1002/jgt.22435)

A stability theorem for maximal Kr+1-free graphs

K Popielarz, J Sahasrabudhe, R Snyder

– Journal of Combinatorial Theory Series B

(2018)

132,

236

(DOI: 10.1016/j.jctb.2018.04.001)

Monochromatic solutions to systems of exponential equations

J Sahasrabudhe

– Journal of Combinatorial Theory. Series A

(2018)

158,

548

(DOI: 10.1016/j.jcta.2018.04.002)

Ramsey Graphs Induce Subgraphs of Many Different Sizes

B Narayanan, J Sahasrabudhe, I Tomon

– Combinatorica: an international journal on combinatorics and the theory of computing

(2018)

39,

215

(DOI: 10.1007/s00493-017-3755-0)

Exponential patterns in arithmetic Ramsey theory

J Sahasrabudhe

– Acta Arithmetica

(2017)

182,

13

(DOI: 10.4064/aa8603-9-2017)

The multiplication table problem for bipartite graphs

BP Narayanan, J Sahasrabudhe, I Tomon

– Combinatorica

(2017)

37,

991

(DOI: 10.1007/s00493-016-3322-0)

On the maximum running time in graph bootstrap percolation

B Bollobás, M Przykucki, O Riordan, J Sahasrabudhe

– Electron. j. comb.

(2017)

24,

ARTN P2.16

(DOI: 10.37236/5771)