Julian Sahasrabudhe

According to our database, Julian Sahasrabudhe authored at least 10 papers between 2012 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2019

Partitioning a graph into monochromatic connected subgraphs.

António Girão, Shoham Letzter, Julian Sahasrabudhe

J. Graph Theory, 2019

Dense subgraphs in random graphs.

Paul Balister, Béla Bollobás, Julian Sahasrabudhe, Alexander Veremyev

Discret. Appl. Math., 2019

Ramsey Graphs Induce Subgraphs of Many Different Sizes.

Bhargav P. Narayanan, Julian Sahasrabudhe, István Tomon

Comb., 2019

2018

Monochromatic solutions to systems of exponential equations.

Julian Sahasrabudhe

J. Comb. Theory, Ser. A, 2018

A stability theorem for maximal <i>K</i>_<i>r</i>+1-free graphs.

Kamil Popielarz, Julian Sahasrabudhe, Richard Snyder

J. Comb. Theory, Ser. B, 2018

2017

On the Maximum Running Time in Graph Bootstrap Percolation.

Béla Bollobás, Michal Przykucki, Oliver Riordan, Julian Sahasrabudhe

Electron. J. Comb., 2017

The multiplication table problem for bipartite graphs.

Bhargav P. Narayanan, Julian Sahasrabudhe, István Tomon

Comb., 2017

2015

Sturmian Words and Constant Additive Complexity.

Julian Sahasrabudhe

Integers, 2015

Permutations Destroying Arithmetic Structure.

Veselin Jungic, Julian Sahasrabudhe

Electron. J. Comb., 2015

2012

On Abelian and Additive Complexity in Infinite Words.

Hayri Ardal, Tom C. Brown, Veselin Jungic, Julian Sahasrabudhe

Integers, 2012