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.
J. Comb. Theory A, 2021

2020
Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs.
Random Struct. Algorithms, 2020

Product-free sets in the free semigroup.
Eur. J. Comb., 2020

On symmetric intersecting families.
Eur. J. Comb., 2020

2019
The number of hypergraphs without linear cycles.
J. Comb. Theory B, 2019

Ramsey Graphs Induce Subgraphs of Many Different Sizes.
Comb., 2019

2018
Line percolation.
Random Struct. Algorithms, 2018

Induced Subgraphs With Many Distinct Degrees.
Comb. Probab. Comput., 2018

2017
Catching a fast robber on the grid.
J. Comb. Theory A, 2017

The multiplication table problem for bipartite graphs.
Comb., 2017

2016
On the stability of the Erdős-Ko-Rado theorem.
J. Comb. Theory A, 2016

Catching a fast robber on the grid.
CoRR, 2016

2015
Approximations to <i>m</i>-Colored Complete Infinite Hypergraphs.
J. Graph Theory, 2015

Disjoint induced subgraphs of the same order and size.
Eur. J. Comb., 2015

2014
Exactly m-coloured complete infinite subgraphs.
J. Comb. Theory B, 2014

A Canonical Ramsey Theorem for Exactly <i>m</i>-Coloured Complete Subgraphs.
Comb. Probab. Comput., 2014


  Loading...