5 citations · 10 across the 3 of their papers we have counts for
3 papers
math.CO2011★ 5 cited
Monochromatic cycles and the monochromatic circumference in 2-coloured graphs
Alex Scott, Matthew White
Li, Nikiforov and Schelp conjectured that a 2-edge coloured graph G with order n and minimal degree strictly greater than 3n/4 contains a monochromatic cycle of length l, for all l…
math.CO2010★ 3 cited
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…
cs.DM2006★ 2 cited
Linear-programming design and analysis of fast algorithms for Max 2-Sat and Max 2-CSP
Alexander D. Scott, Gregory B. Sorkin
The class -CSP, or simply Max 2-CSP, consists of constraint satisfaction problems with at most two -valued variables per clause. For instances with variables and …