|
Professor Alex Scott
Personal Web Page
eMail:
Alexander [dot] Scott [-at-] maths [dot] ox [dot] ac [dot] uk
Contact Form
Phone Number(s):
Reception/Secretary: +44 1865 273525
Direct: +44 1865 (6)15314
Office:
RI.0.26
Departmental Address:
Mathematical Institute
24-29 St Giles'
Oxford
OX1 3LB
England
|
Research Interests:
Combinatorics, probability and related areas
Recent Publications (from MathSciNet):
-
MR2901115 Pending Meeks, Kitty; Scott, Alexander The complexity of flood-filling games on graphs.
Discrete Appl. Math. 160 (2012), no. 7-8, 959–969. 05C57 (05C15)
-
MR2880654 Reviewed Haxell, P. E.; Scott, A. D. On Ryser's conjecture.
Electron. J. Combin. 19 (2012), no. 1, Paper 23, 10 pp. (Reviewer: Michael E. Young) 05C65 (05C70)
-
MR2870279 Pending Scott, Alex; Fey, Mark The minimal covering set in large tournaments.
Soc. Choice Welf. 38 (2012), no. 1, 1–9. 05C20 (05A16 91B14)
-
MR2893251 Reviewed Bollobás, Béla; Pritchard, David; Rothvoß, Thomas; Scott, Alex Cover-decomposition and polychromatic numbers.
Algorithms—ESA 2011,
799–810, Lecture Notes in Comput. Sci., 6942, Springer, Heidelberg, 2011. 05C15 (05C65 90C35)
-
MR2837608 Reviewed Scott, Alex; Sudakov, Benny A bound for the cops and robbers problem.
SIAM J. Discrete Math. 25 (2011), no. 3, 1438–1442. (Reviewer: András Sándor Pluhár) 05C57 (05C85 91A24 91A43)
-
MR2784637 Reviewed Scott, Alexander Szemerédi's regularity lemma for matrices and sparse graphs.
Combin. Probab. Comput. 20 (2011), no. 3, 455–466. (Reviewer: Gábor N. Sárközy) 05C75
-
MR2791447 Reviewed Bollobás, Béla; Scott, Alex Intersections of graphs.
J. Graph Theory 66 (2011), no. 4, 261–282. (Reviewer: Balázs Patkós) 05D05 (05C80 05D40 05E15)
-
MR2815609 Reviewed Loebl, Martin; Reed, Bruce; Scott, Alex; Thomason, Andrew; Thomassé, Stéphan Almost all $H$H-free graphs have the Erdős-Hajnal property.
An irregular mind,
405–414, Bolyai Soc. Math. Stud., 21, János Bolyai Math. Soc., Budapest, 2010. 05C69 (05C35 05C55)
-
MR2651810 Reviewed Bollobás, Béla; Scott, Alex Max $k$k-cut and judicious $k$k-partitions.
Discrete Math. 310 (2010), no. 15-16, 2126–2139. (Reviewer: Jaroslav Ivančo) 05C70 (05C35)
-
MR2573437 Reviewed Aldous, David J.; McDiarmid, Colin; Scott, Alex Uniform multicommodity flow through the complete graph with random
edge-capacities.
Oper. Res. Lett. 37 (2009), no. 5, 299–302. 90B15
More publications
|
