Department of Mathematics, Rutgers University
424 Hill Center, 848 445 7282
narayanan [at] math [dot] rutgers [dot] edu
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.
On the reverse Littlewood–Offord problem of Erdős [PDF].
Submitted, with X. He, T. Juškevičius, and S. Spiro.
Clique supersaturation [PDF].
Submitted, with Q. Dubroff, B. Gunby, and S. Spiro.
Colouring random subgraphs [PDF].
Combinatorics, Probability and Computing, to appear, with B. Bukh and M. Krivelevich.
Antichain codes [PDF].
Bulletin of the London Mathematical Society, 55 (2023), with B. Gunby, X. He and S. Spiro.
Reconstructing random pictures [PDF].
Random Structures & Algorithms, to appear, with C. Yap.
A counterexample to directed-KKL [PDF].
Electronic Journal of Combinatorics, 31 (2024), with Q. Dubroff and S. Nadimpalli.
Down-set thresholds [PDF].
Random Structures & Algorithms, 63 (2023), with B. Gunby and X. He.
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.
Friendly bisections of random graphs [PDF].
Communications of the American Mathematical Society, 2 (2022), with A. Ferber, M. Kwan, A. Sah and M. Sawhney.
Simplicial homeomorphs and trace-bounded hypergraphs [PDF].
Discrete Analysis, 2022:6 (2022), with J. Long and C. Yap.
The threshold for the square of a Hamilton cycle [PDF].
Proceedings of the American Mathematical Society, 149 (2021), with J. Kahn and J. Park.
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.
Subgraphs of large connectivity and chromatic number [PDF].
Bulletin of the London Mathematical Society, 54 (2022), with A. Girão.
A universal exponent for homeomorphs [PDF].
Israel Journal of Mathematics, 243 (2021), with P. Keevash, J. Long and A. Scott.
Counting independent sets in regular hypergraphs [PDF].
Journal of Combinatorial Theory, Series A, 180 (2021), with J. Balogh and B. Bollobás.
Thresholds versus fractional expectation-thresholds [PDF].
Annals of Mathematics, 194 (2021), with K. Frankston, J. Kahn and J. Park.
On symmetric intersecting families of vectors [PDF].
Combinatorics, Probability and Computing, 30 (2021), with S. Eberhard, J. Kahn and S. Spirkl.
Disproportionate division [PDF].
Bulletin of the London Mathematical Society, 52 (2020), with L. Crew and S. Spirkl.
Slowdown for the geodesic-biased random walk [PDF].
Electronic Communications in Probability, 24 (2019), with M. Beliayeu, P. Chmel and J. Petr.
Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs [PDF].
Random Structures and Algorithms, 57, (2020), with M. Schacht.
Turán theorems for unavoidable patterns [PDF].
Mathematical Proceedings of the Cambridge Philosophical Society, 172 (2022), with A. Girão.
Product-free sets in the free semigroup [PDF].
European Journal of Combinatorics, 83 (2020), with I. Leader, S. Letzter and M. Walters.
Spanning surfaces in 3-graphs [PDF].
Journal of the European Mathematical Society, 24 (2022), with A. Georgakopoulos, J. Haslegrave and R. Montgomery.
On symmetric intersecting families [PDF].
European Journal of Combinatorics, 86 (2020), with D. Ellis and G. Kalai.
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
On regular 3-wise intersecting families [PDF].
Proceedings of the American Mathematical Society, 146 (2018), with K. Frankston and J. Kahn.
Long cycles in Hamiltonian graphs [PDF].
Israel Journal of Mathematics, 229 (2019), with A. Girão and T. Kittipassorn.
The number of hypergraphs without linear cycles [PDF].
Journal of Combinatorial Theory, Series B, 134 (2019), with J. Balogh and J. Skokan.
Diffusion on graphs is eventually periodic [PDF].
Journal of Combinatorics, 10 (2019), with J. Long.
Reconstructing random jigsaws [PDF].
Multiplex and Multilevel Networks, Oxford University Press (2018), with P. Balister and B. Bollobás
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.
Coalescence on the real line [PDF] [Code].
Transactions of the American Mathematical Society, 371 (2019), with P. Balister, B. Bollobás, and J. Lee.
On symmetric 3-wise intersecting families [PDF].
Proceedings of the American Mathematical Society, 145 (2017), with D. Ellis.
Induced subgraphs with many distinct degrees [PDF].
Combinatorics, Probability and Computing, 27 (2018), with I. Tomon.
Balancing sums of random vectors [PDF].
Discrete Analysis, 2018:4 (2018), with J. Aru, A. Scott and R. Venkatesan.
Ramsey graphs induce subgraphs of many different sizes [PDF].
Combinatorica, 39 (2019), with J. Sahasrabudhe and I. Tomon.
Connections in randomly oriented graphs [PDF].
Combinatorics, Probability and Computing, Special Oberwolfach Issue, 27 (2018).
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.
Line percolation [PDF].
Random Structures and Algorithms, 52, (2018), 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, 37 (2017), 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).