11 citations · 12 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2014★ 1 cited
Intersections of hypergraphs
Béla Bollobás, Alex Scott
Given two weighted k-uniform hypergraphs G, H of order n, how much (or little) can we make them overlap by placing them on the same vertex set? If we place them at random, how conc…
math.CO2010★ 11 cited
A new bound for the cops and robbers problem
Alex Scott, Benny Sudakov
In this short paper we study the game of cops and robbers, which is played on the vertices of some fixed graph . Cops and a robber are allowed to move along the edges of and…