10 citations · 33 across the 23 of their papers we have counts for
8 papers · 1 filter
Coalescence on the real line
Paul Balister, Béla Bollobás, Jonathan Lee +1
We study a geometrically constrained coalescence model derived from spin systems. Given two probability distributions and on the positive reals with f…
Balancing sums of random vectors
Juhan Aru, Bhargav Narayanan, Alex Scott +1
We study a higher-dimensional 'balls-into-bins' problem. An infinite sequence of i.i.d. random vectors is revealed to us one vector at a time, and we are required to partition thes…
Transference for the Erdős-Ko-Rado theorem
József Balogh, Béla Bollobás, Bhargav Narayanan
For natural numbers with , the Kneser graph is the graph on the family of -element subsets of in which two sets are adjacen…
Ramsey graphs induce subgraphs of many different sizes
Bhargav Narayanan, Julian Sahasrabudhe, István Tomon
A graph on vertices is said to be \emph{-Ramsey} if every clique or independent set of the graph has size at most . The only known constructions of Ramsey graphs a…
Induced subgraphs with many distinct degrees
Bhargav Narayanan, István Tomon
Let denote the size of the largest clique or independent set of a graph . In 2007, Bukh and Sudakov proved that every -vertex graph with c…
Connections in randomly oriented graphs
Bhargav Narayanan
Given an undirected graph , let us randomly orient by tossing independent (possibly biased) coins, one for each edge of . Writing for the event that ther…
Catching a fast robber on the grid
Paul Balister, Béla Bollobás, Bhargav Narayanan +1
We study the problem of cops and robbers on the grid where the robber is allowed to move faster than the cops. It is well known that two cops are necessary and sufficient to catch…
On symmetric 3-wise intersecting families
David Ellis, Bhargav Narayanan
A family of sets is said to be symmetric if its automorphism group is transitive, and -wise intersecting if any three sets in the family have nonempty intersection. Frankl conje…