On the stability of the Erdős–Ko–Rado theorem B Bollobás, BP Narayanan, AM Raigorodskii Journal of Combinatorial Theory, Series A 137, 64-78, 2016 | 73 | 2016 |

Transference for the Erdős–Ko–Rado theorem J Balogh, B Bollobás, BP Narayanan Forum of Mathematics, Sigma 3, 2015 | 32 | 2015 |

Thresholds versus fractional expectation-thresholds K Frankston, J Kahn, B Narayanan, J Park arXiv preprint arXiv:1910.13433, 2019 | 20 | 2019 |

Line percolation P Balister, B Bollobás, J Lee, B Narayanan Random Structures & Algorithms 52 (4), 597-616, 2018 | 13* | 2018 |

The number of hypergraphs without linear cycles J Balogh, B Narayanan, J Skokan Journal of Combinatorial Theory, Series B 134, 309-321, 2019 | 12 | 2019 |

On symmetric intersecting families D Ellis, G Kalai, B Narayanan European Journal of Combinatorics 86, 103094, 2020 | 10 | 2020 |

Catching a fast robber on the grid P Balister, B Bollobás, B Narayanan, A Shaw Journal of Combinatorial Theory, Series A 152, 341-352, 2017 | 8 | 2017 |

Ramsey graphs induce subgraphs of many different sizes B Narayanan, J Sahasrabudhe, I Tomon arXiv preprint arXiv:1609.01705, 2016 | 8 | 2016 |

Turán theorems for unavoidable patterns A Girăo, B Narayanan Mathematical Proceedings of the Cambridge Philosophical Society, 1-20, 2021 | 7 | 2021 |

Diffusion on graphs is eventually periodic J Long, B Narayanan arXiv preprint arXiv:1704.04295, 2017 | 7 | 2017 |

On symmetric 3-wise intersecting families D Ellis, B Narayanan Proceedings of the American Mathematical Society 145 (7), 2843-2847, 2017 | 7 | 2017 |

Exactly m-coloured complete infinite subgraphs BP Narayanan Journal of Combinatorial Theory, Series B 106, 163-173, 2014 | 7 | 2014 |

Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs B Narayanan, M Schacht Random Structures & Algorithms 57 (1), 244-255, 2020 | 5 | 2020 |

Disjoint induced subgraphs of the same order and size B Bollobás, T Kittipassorn, BP Narayanan, AD Scott European Journal of Combinatorics 49, 153-166, 2015 | 5 | 2015 |

Long cycles in Hamiltonian graphs A Girăo, T Kittipassorn, B Narayanan Israel Journal of Mathematics 229 (1), 269-285, 2019 | 4 | 2019 |

Spanning surfaces in 3-graphs A Georgakopoulos, J Haslegrave, R Montgomery, B Narayanan arXiv preprint arXiv:1808.06864, 2018 | 4 | 2018 |

Induced subgraphs with many distinct degrees B Narayanan, I Tomon Combinatorics, Probability and Computing 27 (1), 110-123, 2018 | 4 | 2018 |

An improved lower bound for Folkman's theorem J Balogh, S Eberhard, B Narayanan, A Treglown, AZ Wagner Bulletin of the London Mathematical Society 49 (4), 745-747, 2017 | 4 | 2017 |

A canonical Ramsey theorem for exactly m-coloured complete subgraphs T Kittipassorn, BP Narayanan Combinatorics, Probability and Computing 23 (1), 102-115, 2014 | 4 | 2014 |

Separating path systems V Falgas-Ravry, T Kittipassorn, D Korándi, S Letzter, B Narayanan arXiv preprint arXiv:1311.5051, 2013 | 4 | 2013 |