default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBhargav Narayanan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j21]Boris Bukh
, Michael Krivelevich, Bhargav Narayanan:
Colouring random subgraphs. Comb. Probab. Comput. 34(4): 585-595 (2025)- [j20]Quentin Dubroff, Benjamin Gunby, Bhargav Narayanan, Sam Spiro:
Clique Supersaturation. SIAM J. Discret. Math. 39(3): 1787-1805 (2025) - 2024
- [j19]Quentin Dubroff, Shivam Nadimpalli, Bhargav Narayanan:
A Counterexample to a Directed KKL Inequality. Electron. J. Comb. 31(4) (2024) - 2023
- [j18]Benjamin Gunby, Xiaoyu He, Bhargav Narayanan:
Down-set thresholds. Random Struct. Algorithms 63(2): 442-456 (2023) - 2022
- [i9]Quentin Dubroff, Shivam Nadimpalli, Bhargav Narayanan:
A Counterexample to a Directed KKL Inequality. CoRR abs/2210.02035 (2022) - [i8]Benjamin Gunby, Xiaoyu He, Bhargav Narayanan, Sam Spiro:
Antichain Codes. CoRR abs/2212.08406 (2022) - 2021
- [j17]Sean Eberhard, Jeff Kahn, Bhargav Narayanan, Sophie Spirkl:
On symmetric intersecting families of vectors. Comb. Probab. Comput. 30(6): 899-904 (2021) - [j16]József Balogh, Béla Bollobás, Bhargav P. Narayanan:
Counting independent sets in regular hypergraphs. J. Comb. Theory A 180: 105405 (2021) - [c1]Boris Bukh, Karthik C. S., Bhargav Narayanan:
Applications of Random Algebraic Constructions to Hardness of Approximation. FOCS 2021: 237-244 - [i7]Boris Bukh, Karthik C. S., Bhargav Narayanan:
Applications of Random Algebraic Constructions to Hardness of Approximation. CoRR abs/2111.05518 (2021) - [i6]Boris Bukh, Karthik C. S., Bhargav Narayanan:
Applications of Random Algebraic Constructions to Hardness of Approximation. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j15]Imre Leader, Shoham Letzter, Bhargav P. Narayanan, Mark Walters:
Product-free sets in the free semigroup. Eur. J. Comb. 83 (2020) - [j14]David Ellis, Gil Kalai, Bhargav P. Narayanan:
On symmetric intersecting families. Eur. J. Comb. 86: 103094 (2020) - [j13]Bhargav P. Narayanan, Mathias Schacht:
Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs. Random Struct. Algorithms 57(1): 244-255 (2020)
2010 – 2019
- 2019
- [j12]Bhargav P. Narayanan, Julian Sahasrabudhe, István Tomon:
Ramsey Graphs Induce Subgraphs of Many Different Sizes. Comb. 39(1): 215-237 (2019) - [j11]József Balogh, Bhargav P. Narayanan, Jozef Skokan:
The number of hypergraphs without linear cycles. J. Comb. Theory B 134: 309-321 (2019) - [i5]Logan Crew, Bhargav Narayanan, Sophie Spirkl:
Disproportionate division. CoRR abs/1909.07141 (2019) - [i4]Keith Frankston, Jeff Kahn, Bhargav Narayanan, Jinyoung Park:
Thresholds versus fractional expectation-thresholds. CoRR abs/1910.13433 (2019) - 2018
- [j10]Bhargav P. Narayanan, István Tomon:
Induced Subgraphs With Many Distinct Degrees. Comb. Probab. Comput. 27(1): 110-123 (2018) - [j9]Bhargav Narayanan:
Connections in Randomly Oriented Graphs. Comb. Probab. Comput. 27(4): 667-671 (2018) - [j8]Paul Balister, Béla Bollobás, Jonathan Lee, Bhargav P. Narayanan:
Line percolation. Random Struct. Algorithms 52(4): 597-616 (2018) - 2017
- [j7]Bhargav P. Narayanan, Julian Sahasrabudhe, István Tomon:
The multiplication table problem for bipartite graphs. Comb. 37(5): 991-1010 (2017) - [j6]Paul Balister, Amy Shaw, Béla Bollobás, Bhargav P. Narayanan:
Catching a fast robber on the grid. J. Comb. Theory A 152: 341-352 (2017) - [i3]Stephen D. Miller, Bhargav Narayanan, Ramarathnam Venkatesan:
Coppersmith's lattices and "focus groups": an attack on small-exponent RSA. CoRR abs/1708.09445 (2017) - [i2]Stephen D. Miller, Bhargav Narayanan, Ramarathnam Venkatesan:
Coppersmith's lattices and "focus groups": an attack on small-exponent RSA. IACR Cryptol. ePrint Arch. 2017: 835 (2017) - 2016
- [j5]Béla Bollobás, Bhargav P. Narayanan, Andrei M. Raigorodskii:
On the stability of the Erdős-Ko-Rado theorem. J. Comb. Theory A 137: 64-78 (2016) - [i1]Paul Balister, Scott Binski, Béla Bollobás, Bhargav P. Narayanan:
Catching a fast robber on the grid. CoRR abs/1609.01002 (2016) - 2015
- [j4]Béla Bollobás, Teeradej Kittipassorn, Bhargav P. Narayanan, Alexander D. Scott:
Disjoint induced subgraphs of the same order and size. Eur. J. Comb. 49: 153-166 (2015) - [j3]Teeradej Kittipassorn, Bhargav P. Narayanan:
Approximations to m-Colored Complete Infinite Hypergraphs. J. Graph Theory 80(4): 313-322 (2015) - 2014
- [j2]Teeradej Kittipassorn, Bhargav P. Narayanan:
A Canonical Ramsey Theorem for Exactly m-Coloured Complete Subgraphs. Comb. Probab. Comput. 23(1): 102-115 (2014) - [j1]Bhargav P. Narayanan:
Exactly m-coloured complete infinite subgraphs. J. Comb. Theory B 106: 163-173 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-10-07 23:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
