Research Fellow, DPMMS & St John's College
B.P.Narayanan [at] dpmms [dot] cam [dot] ac [dot] uk
I am a member of the DPMMS and a Research Fellow at St John's College. I am broadly interested in combinatorics and related areas in probability theory and theoretical computer science. I received my PhD in 2015 under the supervision of Béla Bollobás from the University of Cambridge.
My papers may be found below. Here is a copy of my CV. Some other things (including a picture of me) may be found here.
Coalescence on the real line [PDF] [Code].
Submitted.
With P. Balister, B. Bollobás, and J. Lee.
On symmetric 3-wise intersecting families [PDF].
Proceedings of the AMS, To appear.
With D. Ellis.
Induced subgraphs with many distinct degrees [PDF].
Submitted.
With I. Tomon.
Balancing sums of random vectors [PDF].
Submitted.
With J. Aru, A. Scott and R. Venkatesan.
Ramsey graphs induce subgraphs of many different sizes [PDF].
Submitted.
With J. Sahasrabudhe and I. Tomon.
Connections in randomly oriented graphs [PDF].
Combinatorics, Probability and Computing, To appear.
Catching a fast robber on the grid [PDF].
Submitted.
With P. Balister, S. Binski and B. Bollobás.
Line percolation [PDF].
Submitted.
With P. Balister, B. Bollobás, and J. Lee.
Transference for the Erdős-Ko-Rado theorem [PDF].
Forum of Mathematics, Sigma 3 (2015).
With J. Balogh and B. Bollobás.
The multiplication table problem for bipartite graphs [PDF].
Combinatorica, To appear.
With J. Sahasrabudhe and I. Tomon.
On the stability of the Erdős-Ko-Rado theorem [PDF].
Journal of Combinatorial Theory, Series A 137 (2016).
With B. Bollobás and A. Raigorodskii.
Disjoint induced subgraphs of the same order and size [PDF].
European Journal of Combinatorics 49 (2015).
With B. Bollobás, T. Kittipassorn and A. Scott.
Separating path systems [PDF].
Journal of Combinatorics 5 (2014).
With V. Falgas-Ravry, T. Kittipassorn, D. Korándi and S. Letzter.
Approximations to m-coloured complete infinite hypergraphs [PDF].
Journal of Graph Theory 80 (2015).
With T. Kittipassorn.
A canonical Ramsey theorem for exactly m-coloured complete subgraphs [PDF].
Combinatorics, Probability and Computing 23 (2014).
With T. Kittipassorn.
Exactly m-coloured complete infinite subgraphs [PDF].
Journal of Combinatorial Theory, Series B 106 (2014).