A Canonical Ramsey Theorem for Exactly m-Coloured Complete Subgraphs. - Teeradej Kittipassorn; Bhargav P. Narayanan (Comb. Probab. Comput., 2014)

Exactly m-coloured complete infinite subgraphs. - Bhargav P. Narayanan (J. Comb. Theory B, 2014)

Disjoint induced subgraphs of the same order and size. - Béla Bollobás; Teeradej Kittipassorn; Bhargav P. Narayanan; Alexander D. Scott (Eur. J. Comb., 2015)

Approximations to m-Colored Complete Infinite Hypergraphs. - Teeradej Kittipassorn; Bhargav P. Narayanan (J. Graph Theory, 2015)

Catching a fast robber on the grid. - Paul Balister; Scott Binski; Béla Bollobás; Bhargav P. Narayanan (CoRR, 2016)

On the stability of the Erdős-Ko-Rado theorem. - Béla Bollobás; Bhargav P. Narayanan; Andrei M. Raigorodskii (J. Comb. Theory A, 2016)

The multiplication table problem for bipartite graphs. - Bhargav P. Narayanan; Julian Sahasrabudhe; István Tomon (Comb., 2017)

Coppersmith's lattices and "focus groups": an attack on small-exponent RSA. - Stephen D. Miller; Bhargav Narayanan; Ramarathnam Venkatesan (IACR Cryptol. ePrint Arch., 2017)

Catching a fast robber on the grid. - Paul Balister; Amy Shaw; Béla Bollobás; Bhargav P. Narayanan (J. Comb. Theory A, 2017)

Connections in Randomly Oriented Graphs. - Bhargav Narayanan (Comb. Probab. Comput., 2018)

Induced Subgraphs With Many Distinct Degrees. - Bhargav P. Narayanan; István Tomon (Comb. Probab. Comput., 2018)

Line percolation. - Paul Balister; Béla Bollobás; Jonathan Lee; Bhargav P. Narayanan (Random Struct. Algorithms, 2018)

Ramsey Graphs Induce Subgraphs of Many Different Sizes. - Bhargav P. Narayanan; Julian Sahasrabudhe; István Tomon (Comb., 2019)

Disproportionate division. - Logan Crew; Bhargav Narayanan; Sophie Spirkl (CoRR, 2019)

Thresholds versus fractional expectation-thresholds. - Keith Frankston; Jeff Kahn 001; Bhargav Narayanan; Jinyoung Park (CoRR, 2019)

The number of hypergraphs without linear cycles. - József Balogh; Bhargav P. Narayanan; Jozef Skokan (J. Comb. Theory B, 2019)

On symmetric intersecting families. - David Ellis; Gil Kalai; Bhargav P. Narayanan (Eur. J. Comb., 2020)

Product-free sets in the free semigroup. - Imre Leader; Shoham Letzter; Bhargav P. Narayanan; Mark Walters (Eur. J. Comb., 2020)

Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs. - Bhargav P. Narayanan; Mathias Schacht (Random Struct. Algorithms, 2020)

On symmetric intersecting families of vectors. - Sean Eberhard; Jeff Kahn 001; Bhargav Narayanan; Sophie Spirkl (Comb. Probab. Comput., 2021)

Applications of Random Algebraic Constructions to Hardness of Approximation. - Boris Bukh; Karthik C. S. 001; Bhargav Narayanan (Electron. Colloquium Comput. Complex., 2021)

Counting independent sets in regular hypergraphs. - József Balogh; Béla Bollobás; Bhargav P. Narayanan (J. Comb. Theory A, 2021)

Antichain Codes. - Benjamin Gunby; Xiaoyu He; Bhargav Narayanan; Sam Spiro (CoRR, 2022)

Down-set thresholds. - Benjamin Gunby; Xiaoyu He; Bhargav Narayanan (Random Struct. Algorithms, 2023)

A Counterexample to a Directed KKL Inequality. - Quentin Dubroff; Shivam Nadimpalli; Bhargav Narayanan (Electron. J. Comb., 2024)

Colouring random subgraphs. - Boris Bukh; Michael Krivelevich; Bhargav Narayanan (Comb. Probab. Comput., 2025)