10 citations · 33 across the 23 of their papers we have counts for
Showing 2014 · math.COShow all
2 papers · 2 filters
math.CO2014
The multiplication table problem for bipartite graphs
Bhargav Narayanan, Julian Sahasrabudhe, István Tomon
We investigate the following generalisation of the 'multiplication table problem' of Erdős: given a bipartite graph with edges, how large is the set of sizes of its induced sub…
math.CO2014★ 1 cited
On the stability of the Erdős-Ko-Rado theorem
Béla Bollobás, Bhargav Narayanan, Andrei Raigorodskii
Delete the edges of a Kneser graph independently of each other with some probability: for what probabilities is the independence number of this random graph equal to the independen…