10 citations · 33 across the 23 of their papers we have counts for
5 papers · 2 filters
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…
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…