10 citations · 33 across the 23 of their papers we have counts for
5 papers · 1 filter
Simplicial homeomorphs and trace-bounded hypergraphs
Jason Long, Bhargav Narayanan, Corrine Yap
Our first main result is a uniform bound, in every dimension , on the topological Turán numbers of -dimensional simplicial complexes: for each …
The threshold for the square of a Hamilton cycle
Jeff Kahn, Bhargav Narayanan, Jinyoung Park
Resolving a conjecture of Kühn and Osthus from 2012, we show that is the threshold for the random graph to contain the square of a Hamilton cycle.
A universal exponent for homeomorphs
Peter Keevash, Jason Long, Bhargav Narayanan +1
We prove a uniform bound on the topological Turán number of an arbitrary two-dimensional simplicial complex : any -vertex two-dimensional complex with at least $C_S n^{3-1/5}…
Subgraphs of large connectivity and chromatic number
António Girão, Bhargav Narayanan
Resolving a problem raised by Norin, we show that for each , there exists an such that every graph with chromatic number at least conta…
Counting independent sets in regular hypergraphs
Jozsef Balogh, Bela Bollobas, Bhargav Narayanan
Amongst -regular -uniform hypergraphs on vertices, which ones have the largest number of independent sets? While the analogous problem for graphs (originally raised by Gr…