Bhargav Narayanan


Assistant Professor of Mathematics, Rutgers University
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 complete CV.

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

Publications

  1. On regular 3-wise intersecting families [PDF].
    Submitted.
    With K. Frankston and J. Kahn.

  2. Long cycles in Hamiltonian graphs [PDF].
    Submitted.
    With A. Girão and T. Kittipassorn.

  3. Coppersmith's lattices and 'focus groups' - an attack on small-exponent RSA [PDF].
    Submitted.
    With S. Miller and R. Venkatesan.

  4. The number of hypergraphs without linear cycles [PDF].
    Submitted.
    With J. Balogh and J. Skokan.

  5. Diffusion on graphs is eventually periodic [PDF].
    Submitted.
    With J. Long.

  6. Reconstructing random jigsaws [PDF].
    Multiplex and Multilayer Networks, Oxford University Press, To appear.
    With P. Balister and B. Bollobás

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

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

  9. Coalescence on the real line [PDF] [Code].
    Transactions of the American Mathematical Society, To appear.
    With P. Balister, B. Bollobás, and J. Lee.

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

  11. Induced subgraphs with many distinct degrees [PDF].
    Combinatorics, Probability and Computing, To appear.
    With I. Tomon.

  12. Balancing sums of random vectors [PDF].
    Discrete Analysis, To appear.
    With J. Aru, A. Scott and R. Venkatesan.

  13. Ramsey graphs induce subgraphs of many different sizes [PDF].
    Combinatorica, To appear.
    With J. Sahasrabudhe and I. Tomon.

  14. Connections in randomly oriented graphs [PDF].
    Combinatorics, Probability and Computing, To appear.

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

  16. Line percolation [PDF].
    Random Structures and Algorithms, To appear.
    With P. Balister, B. Bollobás, and J. Lee.

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

  18. The multiplication table problem for bipartite graphs [PDF].
    Combinatorica, To appear.
    With J. Sahasrabudhe and I. Tomon.

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

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

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

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

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

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