J. Sahasrabudhe

Publications31
h-index6
Citations75
Highly Influential Citations15
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • T. Erdélyi
  • 159 Publications • 2,280 Citations
  • P. Erdös
  • 752 Publications • 28,390 Citations
  • N. Hindman
  • 268 Publications • 4,178 Citations
  • M. Michelen
  • 22 Publications • 17 Citations
  • Publications
  • Influence
Ramsey Graphs Induce Subgraphs of Many Different Sizes
TLDR
A graph on n vertices is said to be C-Ramsey if every clique or independent set of the graph induces subgraphs of at least n2-o(1) distinct sizes. Expand
  • 7
  • 4
  • PDF
Counting Zeros of Cosine Polynomials: On a Problem of Littlewood
We show that if $A$ is a finite set of non-negative integers then the number of zeros of the function \[ f_A(\theta) = \sum_{a \in A} \cos(a\theta), \] in $[0,2\pi]$, is at least $(\log \log \log… Expand
  • 6
  • 3
  • PDF
Dense subgraphs in random graphs
TLDR
We show that $\omega_{\gamma}(G_{n,p})$ is concentrated on a set of two integers. Expand
  • 6
  • 2
  • PDF
A stability theorem for maximal Kr+1-free graphs
TLDR
For $r \geq 2$, we show that every maximal $K_{r+1}$-free graph $G$ on $n$ vertices with $(1-\frac{1}{r})\frac{n^2}{2}-o(n^{\frac{r+ 1}{r}})$ edges contains a complete $r$-partite subgraph on $(1 - o(1))n$. Expand
  • 2
  • 2
  • PDF
Partitioning a graph into monochromatic connected subgraphs
TLDR
A well-known result by Haxell and Kohayakawa states that the vertices of an $r$-coloured complete graph can be partitioned into $r-1$ monochromatic connected subgraphs of distinct colours; this is a slightly weaker variant of a conjecture by Erdős, Pyber and Gyarfas. Expand
  • 4
  • 2
  • PDF
On Abelian and Additive Complexity in Infinite Words
TLDR
In this note we define bounded additive complexity for infinite words over a finite subset of . Expand
  • 9
  • 1
  • PDF
On the Maximum Running Time in Graph Bootstrap Percolation
TLDR
Graph bootstrap percolation is a simple cellular automaton introduced by Bollob\'as in 1968. Expand
  • 7
  • 1
  • PDF
On a New Idiom in the Study of Entailment
This paper is an experiment in Leibnizian analysis. The reader will recall that Leibniz considered all true sentences to be analytically so. The difference, on his account, between necessary and… Expand
  • 3
  • PDF
Central limit theorems from the roots of probability generating functions
For each $n$, let $X_n \in \{0,\ldots,n\}$ be a random variable with mean $\mu_n$, standard deviation $\sigma_n$, and let \[ P_n(z) = \sum_{k=0}^n \mathbb{P}( X_n = k) z^k ,\] be its probability… Expand
  • 6
  • PDF
Central limit theorems and the geometry of polynomials
Let $X \in \{0,\ldots,n \}$ be a random variable, with mean $\mu$ and standard deviation $\sigma$ and let \[f_X(z) = \sum_{k} \mathbb{P}(X = k) z^k, \] be its probability generating function.… Expand
  • 6
  • PDF
...
1
2
3
4
...