We stand with Ukraine  

Bhargav P. Narayanan

According to our database1, Bhargav P. Narayanan authored at least 16 papers between 2014 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Counting independent sets in regular hypergraphs.
[BibTeX]
[DOI]
József Balogh
,
Béla Bollobás
,
Bhargav P. Narayanan
J. Comb. Theory, Ser. A, 2021

2020
Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs.
[BibTeX]
[DOI]
Bhargav P. Narayanan
,
Mathias Schacht
Random Struct. Algorithms, 2020

Product-free sets in the free semigroup.
[BibTeX]
[DOI]
Imre Leader
,
Shoham Letzter
,
Bhargav P. Narayanan
,
Mark Walters
Eur. J. Comb., 2020

On symmetric intersecting families.
[BibTeX]
[DOI]
David Ellis
,
Gil Kalai
,
Bhargav P. Narayanan
Eur. J. Comb., 2020

2019
The number of hypergraphs without linear cycles.
[BibTeX]
[DOI]
József Balogh
,
Bhargav P. Narayanan
,
Jozef Skokan
J. Comb. Theory, Ser. B, 2019

Ramsey Graphs Induce Subgraphs of Many Different Sizes.
[BibTeX]
[DOI]
Bhargav P. Narayanan
,
Julian Sahasrabudhe
,
István Tomon
Comb., 2019

2018
Line percolation.
[BibTeX]
[DOI]
Paul Balister
,
Béla Bollobás
,
Jonathan Lee
,
Bhargav P. Narayanan
Random Struct. Algorithms, 2018

Induced Subgraphs With Many Distinct Degrees.
[BibTeX]
[DOI]
Bhargav P. Narayanan
,
István Tomon
Comb. Probab. Comput., 2018

2017
Catching a fast robber on the grid.
[BibTeX]
[DOI]
Paul Balister
,
Amy Shaw
,
Béla Bollobás
,
Bhargav P. Narayanan
J. Comb. Theory, Ser. A, 2017

The multiplication table problem for bipartite graphs.
[BibTeX]
[DOI]
Bhargav P. Narayanan
,
Julian Sahasrabudhe
,
István Tomon
Comb., 2017

2016
On the stability of the Erdős-Ko-Rado theorem.
[BibTeX]
[DOI]
Béla Bollobás
,
Bhargav P. Narayanan
,
Andrei M. Raigorodskii
J. Comb. Theory, Ser. A, 2016

Catching a fast robber on the grid.
[BibTeX]
[DOI]
Paul Balister
,
Scott Binski
,
Béla Bollobás
,
Bhargav P. Narayanan
CoRR, 2016

2015
Approximations to <i>m</i>-Colored Complete Infinite Hypergraphs.
[BibTeX]
[DOI]
Teeradej Kittipassorn
,
Bhargav P. Narayanan
J. Graph Theory, 2015

Disjoint induced subgraphs of the same order and size.
[BibTeX]
[DOI]
Béla Bollobás
,
Teeradej Kittipassorn
,
Bhargav P. Narayanan
,
Alexander D. Scott
Eur. J. Comb., 2015

2014
Exactly m-coloured complete infinite subgraphs.
[BibTeX]
[DOI]
Bhargav P. Narayanan
J. Comb. Theory, Ser. B, 2014

A Canonical Ramsey Theorem for Exactly <i>m</i>-Coloured Complete Subgraphs.
[BibTeX]
[DOI]
Teeradej Kittipassorn
,
Bhargav P. Narayanan
Comb. Probab. Comput., 2014


  Loading...