Bhargav Narayanan

Assistant Professor of Mathematics, Rutgers University
424 Hill Center, 848 445 7282
narayanan [at] math [dot] rutgers [dot] edu

I am broadly interested in combinatorics and related areas in probability theory and statistical physics. Some other things, including a picture of me, may be found here.

Before moving to Rutgers, I was a Research Fellow at St John's College and a member of the DPMMS. Earlier, I received my PhD in 2015 from the University of Cambridge under the supervision of Béla Bollobás. Here is a more detailed CV.

I organise the discrete mathematics seminar at Rutgers along with Jeff Kahn. Sign up here for the seminar mailing list.


  1. Thresholds versus fractional expectation-thresholds [PDF].
    With K. Frankston, J. Kahn and J. Park.

  2. On symmetric intersecting families of vectors [PDF].
    With S. Eberhard, J. Kahn and S. Spirkl.

  3. Disproportionate division [PDF].
    Bulletin of the London Mathematical Society, To appear.
    With L. Crew and S. Spirkl.

  4. Slowdown for the geodesic-biased random walk [PDF].
    Electronic Communications in Probability, 24 (2019).
    With M. Beliayeu, P. Chmel and J. Petr.

  5. Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs [PDF].
    Random Structures and Algorithms, To appear.
    With M. Schacht.

  6. Turán theorems for unavoidable patterns [PDF].
    With A. Girão.

  7. Product-free sets in the free semigroup [PDF].
    European Journal of Combinatorics, 83 (2020).
    With I. Leader, S. Letzter and M. Walters.

  8. Spanning surfaces in 3-graphs [PDF].
    With A. Georgakopoulos, J. Haslegrave and R. Montgomery.

  9. On symmetric intersecting families [PDF].
    With D. Ellis and G. Kalai.

  10. Exceptional graphs for the random walk [PDF].
    Annales de l’Institut Henri Poincaré, To appear.
    With J. Aru, C. Groenland, T. Johnston, A. Roberts and A. Scott

  11. On regular 3-wise intersecting families [PDF].
    Proceedings of the American Mathematical Society, 146 (2018).
    With K. Frankston and J. Kahn.

  12. Long cycles in Hamiltonian graphs [PDF].
    Israel Journal of Mathematics, 229 (2019).
    With A. Girão and T. Kittipassorn.

  13. The number of hypergraphs without linear cycles [PDF].
    Journal of Combinatorial Theory, Series B, 134 (2019).
    With J. Balogh and J. Skokan.

  14. Diffusion on graphs is eventually periodic [PDF].
    Journal of Combinatorics, 10 (2019).
    With J. Long.

  15. Reconstructing random jigsaws [PDF].
    Multiplex and Multilevel Networks, Oxford University Press (2018).
    With P. Balister and B. Bollobás

  16. An improved lower bound for Folkman's theorem [PDF].
    Bulletin of the London Mathematical Society, 49 (2017).
    With J. Balogh, S. Eberhard, A. Treglown and A. Wagner.

  17. Coalescence on the real line [PDF] [Code].
    Transactions of the American Mathematical Society, 371 (2019).
    With P. Balister, B. Bollobás, and J. Lee.

  18. On symmetric 3-wise intersecting families [PDF].
    Proceedings of the American Mathematical Society, 145 (2017).
    With D. Ellis.

  19. Induced subgraphs with many distinct degrees [PDF].
    Combinatorics, Probability and Computing, 27 (2018).
    With I. Tomon.

  20. Balancing sums of random vectors [PDF].
    Discrete Analysis, 4 (2018).
    With J. Aru, A. Scott and R. Venkatesan.

  21. Ramsey graphs induce subgraphs of many different sizes [PDF].
    Combinatorica, 39 (2019).
    With J. Sahasrabudhe and I. Tomon.

  22. Connections in randomly oriented graphs [PDF].
    Combinatorics, Probability and Computing, 27, Special Oberwolfach Issue (2018).

  23. Catching a fast robber on the grid [PDF].
    Journal of Combinatorial Theory, Series A, 152 (2017).
    With P. Balister, B. Bollobás and A. Shaw.

  24. Line percolation [PDF].
    Random Structures and Algorithms, 52, (2018).
    With P. Balister, B. Bollobás, and J. Lee.

  25. Transference for the Erdős-Ko-Rado theorem [PDF].
    Forum of Mathematics, Sigma, 3 (2015).
    With J. Balogh and B. Bollobás.

  26. The multiplication table problem for bipartite graphs [PDF].
    Combinatorica, 37 (2017).
    With J. Sahasrabudhe and I. Tomon.

  27. 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.

  28. 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.

  29. Separating path systems [PDF].
    Journal of Combinatorics, 5 (2014).
    With V. Falgas-Ravry, T. Kittipassorn, D. Korándi and S. Letzter.

  30. Approximations to m-coloured complete infinite hypergraphs [PDF].
    Journal of Graph Theory, 80 (2015).
    With T. Kittipassorn.

  31. A canonical Ramsey theorem for exactly m-coloured complete subgraphs [PDF].
    Combinatorics, Probability and Computing, 23 (2014).
    With T. Kittipassorn.

  32. Exactly m-coloured complete infinite subgraphs [PDF].
    Journal of Combinatorial Theory, Series B, 106 (2014).