2 citations · 4 across the 9 of their papers we have counts for
8 papers · 1 filter
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,…
Coppersmith's lattices and "focus groups": an attack on small-exponent RSA
Stephen D. Miller, Bhargav Narayanan, Ramarathnam Venkatesan
We present a principled technique for reducing the lattice and matrix size in some applications of Coppersmith's lattice method for finding roots of modular polynomial equations. M…
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…