10 citations · 33 across the 23 of their papers we have counts for
6 papers · 1 filter
Thresholds versus fractional expectation-thresholds
Keith Frankston, Jeff Kahn, Bhargav Narayanan +1
Proving a conjecture of Talagrand, a fractional version of the 'expectation-threshold' conjecture of Kalai and the second author, we show for any increasing family on a finite…
Disproportionate division
Logan Crew, Bhargav Narayanan, Sophie Spirkl
We study the disproportionate version of the classical cake-cutting problem: how efficiently can we divide a cake, here , among agents with different demands $α_1, α_2,…
Slowdown for the geodesic-biased random walk
Mikhail Beliayeu, Petr Chmel, Bhargav Narayanan +1
Given a connected graph with some subset of its vertices excited and a fixed target vertex, in the geodesic-biased random walk on , a random walker moves as follows: from an…
On symmetric intersecting families of vectors
Sean Eberhard, Jeff Kahn, Bhargav Narayanan +1
A family of vectors is said to be intersecting if any two elements of agree on at least one coordinate. We prove, for fixed , that the size of a symm…
Turán theorems for unavoidable patterns
António Girão, Bhargav Narayanan
We prove Turán-type theorems for two related Ramsey problems raised by Bollobás and by Fox and Sudakov. First, for , we show that any two-colouring of the complete graph o…
Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs
Bhargav Narayanan, Mathias Schacht
For positive integers , an -uniform hypergraph is called an -cycle if there exists a cyclic ordering of its vertices such that each of its edges consists of …