2 citations · 4 across the 10 of their papers we have counts for
7 papers · 2 filters
On regular 3-wise intersecting families
Keith Frankston, Jeff Kahn, Bhargav Narayanan
Ellis and the third author showed, verifying a conjecture of Frankl, that any -wise intersecting family of subsets of admitting a transitive automorphism group…
Long cycles in Hamiltonian graphs
António Girão, Teeradej Kittipassorn, Bhargav Narayanan
We prove that if an -vertex graph with minimum degree at least contains a Hamiltonian cycle, then it contains another cycle of length ; this implies, in particular,…
Reconstructing random jigsaws
Paul Balister, Béla Bollobás, Bhargav Narayanan
A colouring of the edges of an grid is said to be \emph{reconstructible} if the colouring is uniquely determined by the multiset of its \emph{tiles}, where the t…
The number of hypergraphs without linear cycles
József Balogh, Bhargav Narayanan, Jozef Skokan
The -uniform linear -cycle is the -uniform hypergraph on vertices whose edges are sets of consecutive vertices in a cyclic ordering of the vertex set…
Diffusion on graphs is eventually periodic
Jason Long, Bhargav Narayanan
We study a variant of the chip-firing game called \emph{diffusion}. In diffusion on a graph, each vertex of the graph is initially labelled with an integer interpreted as the numbe…
An improved lower bound for Folkman's theorem
József Balogh, Sean Eberhard, Bhargav Narayanan +2
Folkman's Theorem asserts that for each , there exists a natural number such that whenever the elements of are two-coloured, there exists a set $…