203 citations · 470 across the 96 of their papers we have counts for
4 papers · 2 filters
Szemerédi's Regularity Lemma for matrices and sparse graphs
Alexander Scott
Szemerédi's Regularity Lemma is an important tool for analyzing the structure of dense graphs. There are versions of the Regularity Lemma for sparse graphs, but these only apply wh…
Cover-Decomposition and Polychromatic Numbers
Béla Bollobás, David Pritchard, Thomas Rothvoß +1
A colouring of a hypergraph's vertices is polychromatic if every hyperedge contains at least one vertex of each colour; the polychromatic number is the maximum number of colours in…
Covering numbers for graphs and hypergraphs
Bela Bollobas, Alexander Scott
This paper has been withdrawn, as it has been merged into arXiv:1009.6144
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…