Bhargav Narayanan
Bhargav Narayanan
Assistant Professor, Rutgers University
Verified email at math.rutgers.edu - Homepage
Title
Cited by
Cited by
Year
On the stability of the Erdős–Ko–Rado theorem
B Bollobás, BP Narayanan, AM Raigorodskii
Journal of Combinatorial Theory, Series A 137, 64-78, 2016
732016
Transference for the Erdős–Ko–Rado theorem
J Balogh, B Bollobás, BP Narayanan
Forum of Mathematics, Sigma 3, 2015
322015
Thresholds versus fractional expectation-thresholds
K Frankston, J Kahn, B Narayanan, J Park
arXiv preprint arXiv:1910.13433, 2019
202019
Line percolation
P Balister, B Bollobás, J Lee, B Narayanan
Random Structures & Algorithms 52 (4), 597-616, 2018
13*2018
The number of hypergraphs without linear cycles
J Balogh, B Narayanan, J Skokan
Journal of Combinatorial Theory, Series B 134, 309-321, 2019
122019
On symmetric intersecting families
D Ellis, G Kalai, B Narayanan
European Journal of Combinatorics 86, 103094, 2020
102020
Catching a fast robber on the grid
P Balister, B Bollobás, B Narayanan, A Shaw
Journal of Combinatorial Theory, Series A 152, 341-352, 2017
82017
Ramsey graphs induce subgraphs of many different sizes
B Narayanan, J Sahasrabudhe, I Tomon
arXiv preprint arXiv:1609.01705, 2016
82016
Turán theorems for unavoidable patterns
A Girăo, B Narayanan
Mathematical Proceedings of the Cambridge Philosophical Society, 1-20, 2021
72021
Diffusion on graphs is eventually periodic
J Long, B Narayanan
arXiv preprint arXiv:1704.04295, 2017
72017
On symmetric 3-wise intersecting families
D Ellis, B Narayanan
Proceedings of the American Mathematical Society 145 (7), 2843-2847, 2017
72017
Exactly m-coloured complete infinite subgraphs
BP Narayanan
Journal of Combinatorial Theory, Series B 106, 163-173, 2014
72014
Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs
B Narayanan, M Schacht
Random Structures & Algorithms 57 (1), 244-255, 2020
52020
Disjoint induced subgraphs of the same order and size
B Bollobás, T Kittipassorn, BP Narayanan, AD Scott
European Journal of Combinatorics 49, 153-166, 2015
52015
Long cycles in Hamiltonian graphs
A Girăo, T Kittipassorn, B Narayanan
Israel Journal of Mathematics 229 (1), 269-285, 2019
42019
Spanning surfaces in 3-graphs
A Georgakopoulos, J Haslegrave, R Montgomery, B Narayanan
arXiv preprint arXiv:1808.06864, 2018
42018
Induced subgraphs with many distinct degrees
B Narayanan, I Tomon
Combinatorics, Probability and Computing 27 (1), 110-123, 2018
42018
An improved lower bound for Folkman's theorem
J Balogh, S Eberhard, B Narayanan, A Treglown, AZ Wagner
Bulletin of the London Mathematical Society 49 (4), 745-747, 2017
42017
A canonical Ramsey theorem for exactly m-coloured complete subgraphs
T Kittipassorn, BP Narayanan
Combinatorics, Probability and Computing 23 (1), 102-115, 2014
42014
Separating path systems
V Falgas-Ravry, T Kittipassorn, D Korándi, S Letzter, B Narayanan
arXiv preprint arXiv:1311.5051, 2013
42013
The system can't perform the operation now. Try again later.
Articles 1–20