Julian Sahasrabudhe

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Partitioning a graph into monochromatic connected subgraphs.
J. Graph Theory, 2019

Dense subgraphs in random graphs.
Discret. Appl. Math., 2019

Ramsey Graphs Induce Subgraphs of Many Different Sizes.
Comb., 2019

2018
Monochromatic solutions to systems of exponential equations.
J. Comb. Theory, Ser. A, 2018

A stability theorem for maximal <i>K</i><sub><i>r</i>+1</sub>-free graphs.
J. Comb. Theory, Ser. B, 2018

2017
On the Maximum Running Time in Graph Bootstrap Percolation.
Electron. J. Comb., 2017

The multiplication table problem for bipartite graphs.
Comb., 2017

2015
Sturmian Words and Constant Additive Complexity.
Integers, 2015

Permutations Destroying Arithmetic Structure.
Electron. J. Comb., 2015

2012
On Abelian and Additive Complexity in Infinite Words.
Integers, 2012


  Loading...