Bhargav Narayanan

Below is a complete list of publications in reverse chronological order; versions posted here typically include minor revisions and corrections not present in the published versions.

1. Unimodality for Radon partitions of random vectors [PDF].
   Submitted, with S. H. Chan, G. Kalai, N. Ter-Saakov and M. White.

2. Elementary symmetric polynomials under the fixed point measure [PDF].
   Submitted, with A. Khaitan and I. Mata.

3. On the reverse Littlewood–Offord problem of Erdős [PDF].
   Submitted, with X. He, T. Juškevičius and S. Spiro.

4. Clique supersaturation [PDF].
   Submitted, with Q. Dubroff, B. Gunby and S. Spiro.

5. Colouring random subgraphs [PDF].
   Combinatorics, Probability and Computing, to appear, with B. Bukh and M. Krivelevich.

6. Antichain codes [PDF].
   Bulletin of the London Mathematical Society, 55 (2023), with B. Gunby, X. He and S. Spiro.

7. Reconstructing random pictures [PDF].
   Random Structures & Algorithms, to appear, with C. Yap.

8. A counterexample to directed-KKL [PDF].
   Electronic Journal of Combinatorics, 31 (2024), with Q. Dubroff and S. Nadimpalli.

9. Down-set thresholds [PDF].
   Random Structures & Algorithms, 63 (2023), with B. Gunby and X. He.

10. Applications of random algebraic constructions to hardness of approximation [PDF].
    Israel Journal of Mathematics, to appear, and FOCS 2021, 62 (2022), with B. Bukh and Karthik C. S.

11. Friendly bisections of random graphs [PDF].
    Communications of the American Mathematical Society, 2 (2022), with A. Ferber, M. Kwan, A. Sah and M. Sawhney.

12. Simplicial homeomorphs and trace-bounded hypergraphs [PDF].
    Discrete Analysis, 2022:6 (2022), with J. Long and C. Yap.

13. The threshold for the square of a Hamilton cycle [PDF].
    Proceedings of the American Mathematical Society, 149 (2021), with J. Kahn and J. Park.

14. Coppersmith's lattices and focus groups: an attack on small-exponent RSA [PDF].
    Journal of Number Theory, 222 (2021), with S. Miller and R. Venkatesan.

15. Subgraphs of large connectivity and chromatic number [PDF].
    Bulletin of the London Mathematical Society, 54 (2022), with A. Girão.

16. A universal exponent for homeomorphs [PDF].
    Israel Journal of Mathematics, 243 (2021), with P. Keevash, J. Long and A. Scott.

17. Counting independent sets in regular hypergraphs [PDF].
    Journal of Combinatorial Theory, Series A, 180 (2021), with J. Balogh and B. Bollobás.

18. Thresholds versus fractional expectation-thresholds [PDF].
    Annals of Mathematics, 194 (2021), with K. Frankston, J. Kahn and J. Park.

19. On symmetric intersecting families of vectors [PDF].
    Combinatorics, Probability and Computing, 30 (2021), with S. Eberhard, J. Kahn and S. Spirkl.

20. Disproportionate division [PDF].
    Bulletin of the London Mathematical Society, 52 (2020), with L. Crew and S. Spirkl.

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

22. Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs [PDF].
    Random Structures and Algorithms, 57, (2020), with M. Schacht.

23. Turán theorems for unavoidable patterns [PDF].
    Mathematical Proceedings of the Cambridge Philosophical Society, 172 (2022), with A. Girão.

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

25. Spanning surfaces in 3-graphs [PDF].
    Journal of the European Mathematical Society, 24 (2022), with A. Georgakopoulos, J. Haslegrave and R. Montgomery.

26. On symmetric intersecting families [PDF].
    European Journal of Combinatorics, 86 (2020), with D. Ellis and G. Kalai.

27. Exceptional graphs for the random walk [PDF].
    Annales de l’Institut Henri Poincaré, 56 (2020), with J. Aru, C. Groenland, T. Johnston, A. Roberts and A. Scott

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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