Alex D. Scott

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 33

Top Topics

Bipartite Graph

Multicommodity Flow

Boolean Functions

Independent Set

Top Venues

J. Comb. Theory, Ser. B

SIAM J. Discret. Math.

Publications

Tung Nguyen, Alex D. Scott, Paul D. Seymour
On a problem of El-Zahar and Erdős. J. Comb. Theory, Ser. B 165 (2024)
Tung Nguyen, Alex D. Scott, Paul D. Seymour
Induced paths in graphs without anticomplete cycles. J. Comb. Theory, Ser. B 164 (2024)
António Girão, Freddie Illingworth, Alex D. Scott, David R. Wood
Defective coloring of hypergraphs. Random Struct. Algorithms 64 (3) (2024)
Alex D. Scott, Paul D. Seymour
Polynomial bounds for chromatic number. V. Excluding a tree of radius two and a complete multipartite graph. J. Comb. Theory, Ser. B 164 (2024)
Noga Alon, Emil Powierski, Michael Savery, Alex D. Scott, Elizabeth Wilmer
Invertibility of Digraphs and Tournaments. SIAM J. Discret. Math. 38 (1) (2024)
Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
Pure pairs. X. Tournaments and the strong Erdős-Hajnal property. Eur. J. Comb. 115 (2024)
Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
minor. J. Comb. Theory, Ser. B 164 (2024)
Alex D. Scott, Paul D. Seymour, Sophie Theresa Spirkl
Pure Pairs. IX. Transversal Trees. SIAM J. Discret. Math. 38 (1) (2024)
António Girão, Freddie Illingworth, Lukas Michel, Michael Savery, Alex D. Scott
Flashes and Rainbows in Tournaments. Comb. 44 (3) (2024)
Lukas Michel, Alex D. Scott
Lower bounds for graph reconstruction with maximal independent set queries. CoRR (2024)
Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
Polynomial bounds for chromatic number VI. Adding a four-vertex path. Eur. J. Comb. 110 (2023)
Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
Polynomial bounds for chromatic number VII. Disjoint holes. J. Graph Theory 104 (3) (2023)
Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
Strengthening Rödl's theorem. J. Comb. Theory, Ser. B 163 (2023)
Alex D. Scott, Paul D. Seymour, Sophie Spirkl
Pure pairs. IV. Trees in bipartite graphs. J. Comb. Theory, Ser. B 161 (2023)
Carla Groenland, Tom Johnston, Dániel Korándi, Alexander Roberts, Alex D. Scott, Jane Tan
Decomposing Random Permutations into Order-Isomorphic Subpermutations. SIAM J. Discret. Math. 37 (2) (2023)
Freddie Illingworth, Emil Powierski, Alex D. Scott, Youri Tamitegama
Balancing Connected Colourings of Graphs. Electron. J. Comb. 30 (1) (2023)
Carla Groenland, Tom Johnston, Andrey Kupavskii, Kitty Meeks, Alex D. Scott, Jane Tan
Reconstructing the degree sequence of a sparse graph from a partial deck. J. Comb. Theory, Ser. B 157 (2022)
Alex D. Scott, Paul D. Seymour, Sophie Spirkl
Polynomial bounds for chromatic number II: Excluding a star-forest. J. Graph Theory 101 (2) (2022)
Alex D. Scott, Paul D. Seymour, Sophie Spirkl
Polynomial bounds for chromatic number. III. Excluding a double star. J. Graph Theory 101 (2) (2022)
Paul Balister, Emil Powierski, Alex D. Scott, Jane Tan
A Note on Infinite Antichain Density. SIAM J. Discret. Math. 36 (1) (2022)
Nemanja Draganic, François Dross, Jacob Fox, António Girão, Frédéric Havet, Dániel Korándi, William Lochet, David Munhá Correia, Alex D. Scott, Benny Sudakov
Powers of paths in tournaments. Comb. Probab. Comput. 30 (6) (2021)
Natasha Morrison, Alexander Roberts, Alex D. Scott
Maximising the number of cycles in graphs with forbidden subgraphs. J. Comb. Theory, Ser. B 147 (2021)
Carla Groenland, Hannah Guggiari, Alex D. Scott
Size reconstructibility of graphs. J. Graph Theory 96 (2) (2021)
Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
Pure Pairs. II. Excluding All Subdivisions of A Graph. Comb. 41 (3) (2021)
Marthe Bonamy, Louis Esperet, Carla Groenland, Alex D. Scott
Optimal labelling schemes for adjacency, comparability, and reachability. STOC (2021)
Tom Johnston, Alex D. Scott
Lipschitz bijections between boolean functions. Comb. Probab. Comput. 30 (4) (2021)
Marthe Bonamy, Louis Esperet, Carla Groenland, Alex D. Scott
Optimal labelling schemes for adjacency, comparability and reachability. CoRR (2020)
Marthe Bonamy, Nicolas Bousquet, Louis Esperet, Carla Groenland, Chun-Hung Liu, François Pirot, Alex D. Scott
Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces. CoRR (2020)
Carla Groenland, Karolina Okrasa, Pawel Rzazewski, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
H-colouring Pt-free graphs in subexponential time. Discret. Appl. Math. 267 (2019)
Alex D. Scott, Paul D. Seymour
Induced Subgraphs of Graphs With Large Chromatic Number. X. Holes of Specific Residue. Comb. 39 (5) (2019)
Maria Chudnovsky, Jacob Fox, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
Towards Erdős-Hajnal for Graphs with No 5-Hole. Comb. 39 (5) (2019)
Penny E. Haxell, Alex D. Scott
A Note on Intersecting Hypergraphs with Large Cover Number. Electron. J. Comb. 24 (3) (2017)
Peter Jeavons, Alex D. Scott, Lei Xu
Feedback from Nature: Simple Randomised Distributed Algorithms for Maximal Independent Set Selection and Greedy Colouring. CoRR (2016)
Béla Bollobás, Alex D. Scott
Intersections of hypergraphs. J. Comb. Theory, Ser. B 110 (2015)
Béla Bollobás, Alex D. Scott
Intersections of random hypergraphs and tournaments. Eur. J. Comb. 44 (2015)
Natasha Morrison, Jonathan A. Noel, Alex D. Scott
On Saturated k-Sperner Systems. CoRR (2014)
Colin McDiarmid, Alex D. Scott, Paul Withers
Uniform multicommodity flow in the hypercube with random edge capacities. CoRR (2014)
Ross J. Kang, Colin McDiarmid, Bruce A. Reed, Alex D. Scott
-free graphs have a linear homogeneous set. Random Struct. Algorithms 45 (3) (2014)
Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott
Cover-Decomposition and Polychromatic Numbers. SIAM J. Discret. Math. 27 (1) (2013)
Penny E. Haxell, Alex D. Scott
On Ryser's conjecture. Electron. J. Comb. 19 (1) (2012)
Béla Bollobás, Alex D. Scott
Intersections of graphs. J. Graph Theory 66 (4) (2011)
Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott
Cover-Decomposition and Polychromatic Numbers. ESA (2011)
Béla Bollobás, Alex D. Scott
Max k-cut and judicious k-partitions. Discret. Math. 310 (15-16) (2010)
David J. Aldous, Colin McDiarmid, Alex D. Scott
Uniform multicommodity flow through the complete graph with random edge-capacities. Oper. Res. Lett. 37 (5) (2009)
Pierre Charbit, Alex D. Scott
Infinite Locally Random Graphs. Internet Math. 3 (3) (2007)
Béla Bollobás, Alex D. Scott
On separating systems. Eur. J. Comb. 28 (4) (2007)
Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott
Maximum directed cuts in acyclic digraphs. J. Graph Theory 55 (1) (2007)
Béla Bollobás, Alex D. Scott
Separating systems and oriented graphs of diameter two. J. Comb. Theory, Ser. B 97 (2) (2007)
A. J. Radcliffe, Alex D. Scott
Reconstructing under Group Actions. Graphs Comb. 22 (3) (2006)
Béla Bollobás, Alex D. Scott
Judicious partitions of bounded-degree graphs. J. Graph Theory 46 (2) (2004)
Béla Bollobás, Alex D. Scott
Max Cut for Random Graphs with a Planted Partition. Comb. Probab. Comput. 13 (4-5) (2004)
Piotr Berman, Marek Karpinski, Alex D. Scott
Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT Electron. Colloquium Comput. Complex. 10 (022) (2003)
Piotr Berman, Marek Karpinski, Alex D. Scott
Approximation Hardness of Short Symmetric Instances of MAX-3SAT. Electron. Colloquium Comput. Complex. (049) (2003)
Luke Pebody, A. J. Radcliffe, Alex D. Scott
Finite Subsets of the Plane are 18-Reconstructible. SIAM J. Discret. Math. 16 (2) (2003)
Alex D. Scott, Gregory B. Sorkin
Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances. RANDOM-APPROX (2003)
Béla Bollobás, Graham R. Brightwell, Yoshiharu Kohayakawa, Imre Leader, Alex D. Scott
Special Issue on Ramsey Theory. Comb. Probab. Comput. 12 (5-6) (2003)
Ronald J. Gould, Penny E. Haxell, Alex D. Scott
A Note on Cycle Lengths in Graphs. Graphs Comb. 18 (3) (2002)
Béla Bollobás, Alex D. Scott
Problems and results on judicious partitions. Random Struct. Algorithms 21 (3-4) (2002)
Paul N. Balister, Béla Bollobás, Oliver Riordan, Alex D. Scott
Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial. Eur. J. Comb. 22 (1) (2001)
Alex D. Scott
On Induced Subgraphs with All Degrees Odd. Graphs Comb. 17 (3) (2001)
Alex D. Scott
Subdivisions of Transitive Tournaments. Eur. J. Comb. 21 (8) (2000)
Béla Bollobás, Alex D. Scott
Judicious Partitions of 3-uniform Hypergraphs. Eur. J. Comb. 21 (3) (2000)
Alex D. Scott
Induced Cycles and Chromatic Number. J. Comb. Theory, Ser. B 76 (2) (1999)
Béla Bollobás, Alex D. Scott
Exact Bounds for Judicious Partitions of Graphs. Comb. 19 (4) (1999)
A. J. Radcliffe, Alex D. Scott
Reconstructing Subsets of Reals. Electron. J. Comb. 6 (1999)
Alex D. Scott
Another Simple Proof of a Theorem of Milner. J. Comb. Theory, Ser. A 87 (2) (1999)
A. J. Radcliffe, Alex D. Scott
. J. Comb. Theory, Ser. A 83 (2) (1998)
David M. Berman, A. J. Radcliffe, Alex D. Scott, Hong Wang, Larry Wargo
All trees contain a large induced subgraph having all degrees 1 (mod k). Discret. Math. 175 (1-3) (1997)
Béla Bollobás, Alex D. Scott
Independent sets and repeated degrees. Discret. Math. 170 (1-3) (1997)
Alex D. Scott
Reconstructing sequences. Discret. Math. 175 (1-3) (1997)
Alex D. Scott
Induced trees in graphs of large chromatic number. J. Graph Theory 24 (4) (1997)
Alex D. Scott
Better Bounds for Perpetual Gossiping. Discret. Appl. Math. 75 (2) (1997)
Béla Bollobás, Alex D. Scott
Judicious Partitions of Hypergraphs. J. Comb. Theory, Ser. A 78 (1) (1997)
Alex D. Scott
On graph decompositions modulo k. Discret. Math. 175 (1-3) (1997)
Béla Bollobás, Alex D. Scott
A Proof of a Conjecture of Bondy Concerning Paths in Weighted Digraphs. J. Comb. Theory, Ser. B 66 (2) (1996)
A. J. Radcliffe, Alex D. Scott
Every tree contains a large induced subgraph with all degrees odd. Discret. Math. 140 (1-3) (1995)
Alex D. Scott
Large Induced Subgraphs with All Degrees Odd. Comb. Probab. Comput. 1 (1992)