Alex Scott

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 57

Top Topics

Boolean Functions

Bootstrap Sampling

Top Venues

J. Comb. Theory, Ser. B

J. Graph Theory

Publications

António Girão, Freddie Illingworth, Emil Powierski, Michael Savery, Alex Scott, Youri Tamitegama, Jane Tan
Induced Subgraphs of Induced Subgraphs of Large Chromatic Number. Comb. 44 (1) (2024)
Tung Nguyen, Alex Scott, Paul D. Seymour
A Note on the Gyárfás-Sumner Conjecture. Graphs Comb. 40 (2) (2024)
Paul Balister, Emil Powierski, Alex Scott, Jane Tan
Counting partitions of G n , 1 / 2 $$ {G}_{n,1/2} $$ with degree congruence conditions. Random Struct. Algorithms 62 (3) (2023)
Alex Scott, Paul D. Seymour, Sophie Spirkl
Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix. J. Comb. Theory, Ser. B 161 (2023)
Sergey Norin, Alex Scott, David R. Wood
Clustered colouring of graph classes with bounded treedepth or pathwidth. Comb. Probab. Comput. 32 (1) (2023)
Torsten Heinrich, Yoojin Jang, Luca Mungo, Marco Pangallo, Alex Scott, Bassel Tarbush, Samuel C. Wiese
Best-response dynamics, playing sequences, and convergence to equilibrium in random games. Int. J. Game Theory 52 (3) (2023)
Tom Johnston, Michael Savery, Alex Scott, Bassel Tarbush
Game Connectivity and Adaptive Dynamics. CoRR (2023)
Alex Scott, Paul D. Seymour, Sophie Spirkl
Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path. Comb. 43 (5) (2023)
Alex Scott, Paul D. Seymour, Sophie Spirkl
Pure Pairs. V. Excluding Some Long Subdivision. Comb. 43 (3) (2023)
Lukas Michel, Alex Scott
Superpolynomial smoothed complexity of 3-FLIP in Local Max-Cut. CoRR (2023)
Maria Chudnovsky, Patrick Hompe, Alex Scott, Paul D. Seymour, Sophie Spirkl
Concatenating Bipartite Graphs. Electron. J. Comb. 29 (2) (2022)
Tom Johnston, Gal Kronenberg, Alexander Roberts, Alex Scott
Shotgun assembly of random graphs. CoRR (2022)
Michal Przykucki, Alexander Roberts, Alex Scott
Shotgun reconstruction in the hypercube. Random Struct. Algorithms 60 (1) (2022)
António Girão, Gal Kronenberg, Alex Scott
A multidimensional Ramsey Theorem. CoRR (2022)
Noga Alon, Emil Powierski, Michael Savery, Alex Scott, Elizabeth Wilmer
Invertibility of digraphs and tournaments. CoRR (2022)
Alex Scott, Paul D. Seymour, Sophie Spirkl
Pure Pairs VI: Excluding an Ordered Tree. SIAM J. Discret. Math. 36 (1) (2022)
Colin McDiarmid, Alex Scott, Paul Withers
The component structure of dense random subgraphs of the hypercube. Random Struct. Algorithms 59 (1) (2021)
Maria Chudnovsky, Alex Scott, Paul D. Seymour
Finding a Shortest Odd Hole. ACM Trans. Algorithms 17 (2) (2021)
Quentin Lutz, Elie de Panafieu, Maya Stein, Alex Scott
Active clustering for labeling training data. NeurIPS (2021)
Hannah Guggiari, Alex Scott
Monochromatic Components in Edge-Coloured Graphs with Large Minimum Degree. Electron. J. Comb. 28 (1) (2021)
Quentin Lutz, Élie de Panafieu, Alex Scott, Maya Stein
Active clustering for labeling training data. CoRR (2021)
Maria Chudnovsky, Alex Scott, Paul D. Seymour, Sophie Spirkl
A note on simplicial cliques. Discret. Math. 344 (9) (2021)
Maria Chudnovsky, Alex Scott, Paul D. Seymour
Detecting a Long Odd Hole. Comb. 41 (1) (2021)
Maria Chudnovsky, Alex Scott, Paul D. Seymour
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings. J. Comb. Theory, Ser. B 150 (2021)
Alex Scott, Paul D. Seymour
A survey of χ-boundedness. J. Graph Theory 95 (3) (2020)
Maria Chudnovsky, Jacob Fox, Alex Scott, Paul D. Seymour, Sophie Spirkl
Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs. J. Graph Theory 95 (3) (2020)
Alex Scott, Paul D. Seymour
Induced subgraphs of graphs with large chromatic number. VII. Gyárfás' complementation conjecture. J. Comb. Theory, Ser. B 142 (2020)
Alex Scott, Paul D. Seymour
Induced subgraphs of graphs with large chromatic number. XIII. New brooms. Eur. J. Comb. 84 (2020)
Maria Chudnovsky, Alex Scott, Paul D. Seymour, Sophie Spirkl
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes. J. Comb. Theory, Ser. B 140 (2020)
Maria Chudnovsky, Alex Scott, Paul D. Seymour, Sophie Spirkl
Detecting an Odd Hole. J. ACM 67 (1) (2020)
Marthe Bonamy, Natasha Morrison, Alex Scott
Partitioning the vertices of a torus into isomorphic subgraphs. J. Comb. Theory, Ser. A 174 (2020)
Alex Scott, Paul D. Seymour
Induced subgraphs of graphs with large chromatic number. VI. Banana trees. J. Comb. Theory, Ser. B 145 (2020)
Alex Scott, Paul D. Seymour, David R. Wood
Bad news for chordal partitions. J. Graph Theory 90 (1) (2019)
Bruce A. Reed, Alex Scott, Paul D. Seymour
Near-domination in graphs. J. Comb. Theory, Ser. A 165 (2019)
Hannah Guggiari, Alex Scott
Maximising -colourings of graphs. J. Graph Theory 92 (2) (2019)
Sergey Norin, Alex Scott, Paul D. Seymour, David R. Wood
Clustered Colouring in Minor-Closed Classes. Comb. 39 (6) (2019)
Maria Chudnovsky, Alex Scott, Paul D. Seymour
Induced subgraphs of graphs with large chromatic number. XI. Orientations. Eur. J. Comb. 76 (2019)
Maria Chudnovsky, Alex Scott, Paul D. Seymour
Induced subgraphs of graphs with large chromatic number. XII. Distant stars. J. Graph Theory 92 (3) (2019)
Maria Chudnovsky, Alex Scott, Paul D. Seymour
Disjoint paths in unions of tournaments. J. Comb. Theory, Ser. B 135 (2019)
Jonathan A. Noel, Alex Scott, Benny Sudakov
Supersaturation in posets and applications involving the container method. J. Comb. Theory, Ser. A 154 (2018)
Carla Groenland, Alex Scott
-free graphs in subexponential time. CoRR (2018)
Tom Johnston, Alex Scott
Lipschitz bijections between boolean functions. CoRR (2018)
Humberto Naves, Oleg Pikhurko, Alex Scott
How unproportional must a graph be? Eur. J. Comb. 73 (2018)
Alex Scott, Paul D. Seymour
Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes. J. Comb. Theory, Ser. B 132 (2018)
Alex Scott, David R. Wood
Better bounds for poset dimension and boxicity. CoRR (2018)
Alexander Roberts, Alex Scott
Stability results for graphs with a critical edge. Eur. J. Comb. 74 (2018)
Colin McDiarmid, Alex Scott, Paul Withers
Uniform multicommodity flows in the hypercube with random edge-capacities. Random Struct. Algorithms 50 (3) (2017)
Natasha Morrison, Alex Scott
Maximising the number of induced cycles in a graph. J. Comb. Theory, Ser. B 126 (2017)
Natasha Morrison, Jonathan A. Noel, Alex Scott
Saturation in the Hypercube and Bootstrap Percolation. Comb. Probab. Comput. 26 (1) (2017)
Alex Scott, Paul D. Seymour
Induced Subgraphs of Graphs with Large Chromatic Number IX: Rainbow Paths. Electron. J. Comb. 24 (2) (2017)
Béla Bollobás, Svante Janson, Alex Scott
Packing random graphs and hypergraphs. Random Struct. Algorithms 51 (1) (2017)
Maria Chudnovsky, Alex Scott, Paul D. Seymour
Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes. Comb. 37 (6) (2017)
Maria Chudnovsky, Alex Scott, Paul D. Seymour
Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures. J. Comb. Theory, Ser. B 118 (2016)
Alex Scott, Paul D. Seymour
Induced subgraphs of graphs with large chromatic number. I. Odd holes. J. Comb. Theory, Ser. B 121 (2016)
Peter Jeavons, Alex Scott, Lei Xu
Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring. Distributed Comput. 29 (5) (2016)
Colin McDiarmid, Alex Scott
Random graphs from a block-stable class. Eur. J. Comb. 58 (2016)
Maria Chudnovsky, Katherine Edwards, Ringi Kim, Alex Scott, Paul D. Seymour
Disjoint dijoins. J. Comb. Theory, Ser. B 120 (2016)
Maria Chudnovsky, Alex Scott, Paul D. Seymour
Excluding pairs of graphs. J. Comb. Theory, Ser. B 106 (2014)
Natasha Morrison, Jonathan A. Noel, Alex Scott
On Saturated k-Sperner Systems. Electron. J. Comb. 21 (3) (2014)
Natasha Morrison, Jonathan A. Noel, Alex Scott
Saturation in the Hypercube and Bootstrap Percolation. CoRR (2014)
Alex Scott, Elizabeth Wilmer
Hypergraphs of Bounded Disjointness. SIAM J. Discret. Math. 28 (1) (2014)
Alex Scott, Peter Jeavons, Lei Xu
Feedback from nature: an optimal distributed algorithm for maximal independent set selection. PODC (2013)
Eli Berger, Krzysztof Choromanski, Maria Chudnovsky, Jacob Fox, Martin Loebl, Alex Scott, Paul D. Seymour, Stéphan Thomassé
Tournaments and colouring. J. Comb. Theory, Ser. B 103 (1) (2013)
Felix Brandt, Maria Chudnovsky, Ilhee Kim, Gaku Liu, Sergey Norin, Alex Scott, Paul D. Seymour, Stéphan Thomassé
A counterexample to a conjecture of Schwartz. Soc. Choice Welf. 40 (3) (2013)
Maria Chudnovsky, Irena Penev, Alex Scott, Nicolas Trotignon
Substitution and χ-boundedness. J. Comb. Theory, Ser. B 103 (5) (2013)
Alex Scott, Mark Fey
The minimal covering set in large tournaments. Soc. Choice Welf. 38 (1) (2012)
Maria Chudnovsky, Irena Penev, Alex Scott, Nicolas Trotignon
Excluding Induced Subdivisions of the Bull and Related Graphs. J. Graph Theory 71 (1) (2012)
Alex Scott, Peter Jeavons, Lei Xu
Feedback from nature: an optimal distributed algorithm for maximal independent set selection CoRR (2012)
Fabrício Siqueira Benevides, Tomasz Luczak, Alex Scott, Jozef Skokan, M. White
Monochromatic Cycles in 2-Coloured Graphs. Comb. Probab. Comput. 21 (1-2) (2012)
Alex Scott, Benny Sudakov
A Bound for the Cops and Robbers Problem. SIAM J. Discret. Math. 25 (3) (2011)