Large Induced Subgraphs with All Degrees Odd. - Alex D. Scott (Comb. Probab. Comput., 1992)

Every tree contains a large induced subgraph with all degrees odd. - A. J. Radcliffe; Alex D. Scott (Discret. Math., 1995)

A Proof of a Conjecture of Bondy Concerning Paths in Weighted Digraphs. - Béla Bollobás; Alex D. Scott (J. Comb. Theory B, 1996)

Better Bounds for Perpetual Gossiping. - Alex D. Scott (Discret. Appl. Math., 1997)

All trees contain a large induced subgraph having all degrees 1 (mod k). - David M. Berman; A. J. Radcliffe; Alex D. Scott; Hong Wang 005; Larry Wargo (Discret. Math., 1997)

Independent sets and repeated degrees. - Béla Bollobás; Alex D. Scott (Discret. Math., 1997)

Reconstructing sequences. - Alex D. Scott (Discret. Math., 1997)

On graph decompositions modulo k. - Alex D. Scott (Discret. Math., 1997)

Judicious Partitions of Hypergraphs. - Béla Bollobás; Alex D. Scott (J. Comb. Theory A, 1997)

Induced trees in graphs of large chromatic number. - Alex D. Scott (J. Graph Theory, 1997)

Reconstructing Subsets of Zn. - A. J. Radcliffe; Alex D. Scott (J. Comb. Theory A, 1998)

Exact Bounds for Judicious Partitions of Graphs. - Béla Bollobás; Alex D. Scott (Comb., 1999)

Reconstructing Subsets of Reals. - A. J. Radcliffe; Alex D. Scott (Electron. J. Comb., 1999)

Another Simple Proof of a Theorem of Milner. - Alex D. Scott (J. Comb. Theory A, 1999)

Induced Cycles and Chromatic Number. - Alex D. Scott (J. Comb. Theory B, 1999)

Judicious Partitions of 3-uniform Hypergraphs. - Béla Bollobás; Alex D. Scott (Eur. J. Comb., 2000)

Subdivisions of Transitive Tournaments. - Alex D. Scott (Eur. J. Comb., 2000)

Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial. - Paul N. Balister; Béla Bollobás; Oliver Riordan; Alex D. Scott (Eur. J. Comb., 2001)

On Induced Subgraphs with All Degrees Odd. - Alex D. Scott (Graphs Comb., 2001)

A Note on Cycle Lengths in Graphs. - Ronald J. Gould; Penny E. Haxell; Alex D. Scott (Graphs Comb., 2002)

Problems and results on judicious partitions. - Béla Bollobás; Alex D. Scott (Random Struct. Algorithms, 2002)

Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances. - Alex D. Scott; Gregory B. Sorkin (RANDOM-APPROX, 2003)

Special Issue on Ramsey Theory. - Béla Bollobás; Graham R. Brightwell; Yoshiharu Kohayakawa; Imre Leader; Alex D. Scott (Comb. Probab. Comput., 2003)

Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT - Piotr Berman; Marek Karpinski; Alex D. Scott (Electron. Colloquium Comput. Complex., 2003)

Approximation Hardness of Short Symmetric Instances of MAX-3SAT. - Piotr Berman; Marek Karpinski; Alex D. Scott (Electron. Colloquium Comput. Complex., 2003)

Finite Subsets of the Plane are 18-Reconstructible. - Luke Pebody; A. J. Radcliffe; Alex D. Scott (SIAM J. Discret. Math., 2003)

Max Cut for Random Graphs with a Planted Partition. - Béla Bollobás; Alex D. Scott (Comb. Probab. Comput., 2004)

Topics in Graph Automorphisms and Reconstruction by Josef Lauri and Raffaele Scapellato, Cambridge University Press, 2003, 172 pp. - Alexander D. Scott (Comb. Probab. Comput., 2004)

Computational Complexity of Some Restricted Instances of 3SAT - Piotr Berman; Marek Karpinski; Alexander D. Scott (Electron. Colloquium Comput. Complex., 2004)

Judicious partitions of bounded-degree graphs. - Béla Bollobás; Alex D. Scott (J. Graph Theory, 2004)

Judicious partitions and related problems. - Alexander D. Scott (BCC, 2005)

An LP-Designed Algorithm for Constraint Satisfaction. - Alexander D. Scott; Gregory B. Sorkin (ESA, 2006)

Polynomial Constraint Satisfaction: A Framework for Counting and Sampling CSPs and Other Problems - Alexander D. Scott; Gregory B. Sorkin (CoRR, 2006)

Linear-programming design and analysis of fast algorithms for Max 2-Sat and Max 2-CSP - Alexander D. Scott; Gregory B. Sorkin (CoRR, 2006)

On Dependency Graphs and the Lattice Gas. - Alexander D. Scott; Alan D. Sokal (Comb. Probab. Comput., 2006)

Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time. - Alexander D. Scott; Gregory B. Sorkin (Comb. Probab. Comput., 2006)

Reconstructing under Group Actions. - A. J. Radcliffe; Alex D. Scott (Graphs Comb., 2006)

Computational complexity of some restricted instances of 3-SAT. - Piotr Berman; Marek Karpinski; Alexander D. Scott (Discret. Appl. Math., 2007)

Linear-programming design and analysis of fast algorithms for Max 2-CSP. - Alexander D. Scott; Gregory B. Sorkin (Discret. Optim., 2007)

On separating systems. - Béla Bollobás; Alex D. Scott (Eur. J. Comb., 2007)

Infinite Locally Random Graphs. - Pierre Charbit; Alex D. Scott (Internet Math., 2007)

Separating systems and oriented graphs of diameter two. - Béla Bollobás; Alex D. Scott (J. Comb. Theory B, 2007)

Maximum directed cuts in acyclic digraphs. - Noga Alon; Béla Bollobás; András Gyárfás; Jenö Lehel; Alex D. Scott (J. Graph Theory, 2007)

Uniform multicommodity flow through the complete graph with random edge-capacities. - David J. Aldous; Colin McDiarmid; Alex D. Scott (Oper. Res. Lett., 2009)

Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function. - Alexander D. Scott; Gregory B. Sorkin (ACM Trans. Algorithms, 2009)

Structure of random r-SAT below the pure literal threshold - Alexander D. Scott; Gregory B. Sorkin (CoRR, 2010)

Max k-cut and judicious k-partitions. - Béla Bollobás; Alex D. Scott (Discret. Math., 2010)

Cover-Decomposition and Polychromatic Numbers. - Béla Bollobás; David Pritchard 001; Thomas Rothvoß; Alex D. Scott (ESA, 2011)

The complexity of Free-Flood-It on 2xn boards - Kitty Meeks; Alexander Scott 001 (CoRR, 2011)

Szemerédi's Regularity Lemma for Matrices and Sparse Graphs. - Alexander Scott 001 (Comb. Probab. Comput., 2011)

Intersections of graphs. - Béla Bollobás; Alex D. Scott (J. Graph Theory, 2011)

A Bound for the Cops and Robbers Problem. - Alex Scott 001; Benny Sudakov (SIAM J. Discret. Math., 2011)

Spanning Trees and the Complexity of Flood-Filling Games. - Kitty Meeks; Alexander Scott 001 (FUN, 2012)

On Ryser's conjecture. - Penny E. Haxell; Alex D. Scott (Electron. J. Comb., 2012)

Monochromatic Cycles in 2-Coloured Graphs. - Fabrício Siqueira Benevides; Tomasz Luczak 001; Alex Scott 001; Jozef Skokan; M. White (Comb. Probab. Comput., 2012)

The complexity of flood-filling games on graphs. - Kitty Meeks; Alexander Scott 001 (Discret. Appl. Math., 2012)

Excluding Induced Subdivisions of the Bull and Related Graphs. - Maria Chudnovsky; Irena Penev; Alex Scott 001; Nicolas Trotignon (J. Graph Theory, 2012)

The minimal covering set in large tournaments. - Alex Scott 001; Mark Fey (Soc. Choice Welf., 2012)

Feedback from nature: an optimal distributed algorithm for maximal independent set selection. - Alex Scott 001; Peter Jeavons 001; Lei Xu 002 (PODC, 2013)

Tournaments and colouring. - Eli Berger; Krzysztof Choromanski; Maria Chudnovsky; Jacob Fox; Martin Loebl; Alex Scott 001; Paul D. Seymour; Stéphan Thomassé (J. Comb. Theory B, 2013)

Substitution and χ-boundedness. - Maria Chudnovsky; Irena Penev; Alex Scott 001; Nicolas Trotignon (J. Comb. Theory B, 2013)

A counterexample to a conjecture of Schwartz. - Felix Brandt 001; Maria Chudnovsky; Ilhee Kim; Gaku Liu; Sergey Norin; Alex Scott 001; Paul D. Seymour; Stéphan Thomassé (Soc. Choice Welf., 2013)

The complexity of Free-Flood-It on 2×n boards. - Kitty Meeks; Alexander Scott 001 (Theor. Comput. Sci., 2013)

On Saturated k-Sperner Systems. - Natasha Morrison; Jonathan A. Noel; Alex Scott 001 (Electron. J. Comb., 2014)

Uniform multicommodity flow in the hypercube with random edge capacities. - Colin McDiarmid; Alex D. Scott; Paul Withers (CoRR, 2014)

Excluding pairs of graphs. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour (J. Comb. Theory B, 2014)

For most graphs H, most H-free graphs have a linear homogeneous set. - Ross J. Kang; Colin McDiarmid; Bruce A. Reed; Alex D. Scott (Random Struct. Algorithms, 2014)

Hypergraphs of Bounded Disjointness. - Alex Scott 001; Elizabeth Wilmer (SIAM J. Discret. Math., 2014)

Disjoint induced subgraphs of the same order and size. - Béla Bollobás; Teeradej Kittipassorn; Bhargav P. Narayanan; Alexander D. Scott (Eur. J. Comb., 2015)

Intersections of random hypergraphs and tournaments. - Béla Bollobás; Alex D. Scott (Eur. J. Comb., 2015)

Intersections of hypergraphs. - Béla Bollobás; Alex D. Scott (J. Comb. Theory B, 2015)

Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring. - Peter Jeavons 001; Alex Scott 001; Lei Xu 002 (Distributed Comput., 2016)

Random graphs from a block-stable class. - Colin McDiarmid; Alex Scott 001 (Eur. J. Comb., 2016)

The parameterised complexity of list problems on graphs of bounded treewidth. - Kitty Meeks; Alexander Scott 001 (Inf. Comput., 2016)

Disjoint dijoins. - Maria Chudnovsky; Katherine Edwards; Ringi Kim; Alex Scott 001; Paul D. Seymour (J. Comb. Theory B, 2016)

Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour (J. Comb. Theory B, 2016)

Induced subgraphs of graphs with large chromatic number. I. Odd holes. - Alex Scott 001; Paul D. Seymour (J. Comb. Theory B, 2016)

Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour (Comb., 2017)

A Note on Intersecting Hypergraphs with Large Cover Number. - Penny E. Haxell; Alex D. Scott (Electron. J. Comb., 2017)

Induced Subgraphs of Graphs with Large Chromatic Number IX: Rainbow Paths. - Alex Scott 001; Paul D. Seymour (Electron. J. Comb., 2017)

Saturation in the Hypercube and Bootstrap Percolation. - Natasha Morrison; Jonathan A. Noel; Alex Scott 001 (Comb. Probab. Comput., 2017)

Maximising the number of induced cycles in a graph. - Natasha Morrison; Alex Scott 001 (J. Comb. Theory B, 2017)

On Lower Bounds for the Matching Number of Subcubic Graphs. - Penny E. Haxell; Alexander D. Scott (J. Graph Theory, 2017)

Packing random graphs and hypergraphs. - Béla Bollobás; Svante Janson; Alex Scott 001 (Random Struct. Algorithms, 2017)

Uniform multicommodity flows in the hypercube with random edge-capacities. - Colin McDiarmid; Alex Scott 001; Paul Withers (Random Struct. Algorithms, 2017)

H-colouring Pt-free graphs in subexponential time. - Carla Groenland; Alex Scott 001 (CoRR, 2018)

Better bounds for poset dimension and boxicity. - Alex Scott 001; David R. Wood (CoRR, 2018)

How unproportional must a graph be? - Humberto Naves; Oleg Pikhurko; Alex Scott 001 (Eur. J. Comb., 2018)

Stability results for graphs with a critical edge. - Alexander Roberts; Alex Scott 001 (Eur. J. Comb., 2018)

Supersaturation in posets and applications involving the container method. - Jonathan A. Noel; Alex Scott 001; Benny Sudakov (J. Comb. Theory A, 2018)

Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes. - Alex Scott 001; Paul D. Seymour (J. Comb. Theory B, 2018)

Towards Erdős-Hajnal for Graphs with No 5-Hole. - Maria Chudnovsky; Jacob Fox; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (Comb., 2019)

Clustered Colouring in Minor-Closed Classes. - Sergey Norin; Alex Scott 001; Paul D. Seymour; David R. Wood (Comb., 2019)

Induced Subgraphs of Graphs With Large Chromatic Number. X. Holes of Specific Residue. - Alex D. Scott; Paul D. Seymour (Comb., 2019)

H-colouring Pt-free graphs in subexponential time. - Carla Groenland; Karolina Okrasa; Pawel Rzazewski; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (Discret. Appl. Math., 2019)

Induced subgraphs of graphs with large chromatic number. XI. Orientations. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour (Eur. J. Comb., 2019)

Disjoint paths in unions of tournaments. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour (J. Comb. Theory B, 2019)

Near-domination in graphs. - Bruce A. Reed; Alex Scott 001; Paul D. Seymour (J. Comb. Theory A, 2019)

Induced subgraphs of graphs with large chromatic number. XII. Distant stars. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour (J. Graph Theory, 2019)

Maximising -colourings of graphs. - Hannah Guggiari; Alex Scott 001 (J. Graph Theory, 2019)

Bad news for chordal partitions. - Alex Scott 001; Paul D. Seymour; David R. Wood (J. Graph Theory, 2019)

Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces. - Marthe Bonamy; Nicolas Bousquet 001; Louis Esperet; Carla Groenland; Chun-Hung Liu; François Pirot; Alex D. Scott (CoRR, 2020)

Induced subgraphs of graphs with large chromatic number. XIII. New brooms. - Alex Scott 001; Paul D. Seymour (Eur. J. Comb., 2020)

Detecting an Odd Hole. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour; Sophie Spirkl (J. ACM, 2020)

Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory, Ser. B, 2020)

Partitioning the vertices of a torus into isomorphic subgraphs. - Marthe Bonamy; Natasha Morrison; Alex Scott 001 (J. Comb. Theory A, 2020)

Induced subgraphs of graphs with large chromatic number. VII. Gyárfás' complementation conjecture. - Alex Scott 001; Paul D. Seymour (J. Comb. Theory B, 2020)

Induced subgraphs of graphs with large chromatic number. VI. Banana trees. - Alex Scott 001; Paul D. Seymour (J. Comb. Theory B, 2020)

Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs. - Maria Chudnovsky; Jacob Fox; Alex Scott 001; Paul D. Seymour; Sophie Spirkl (J. Graph Theory, 2020)

A survey of χ-boundedness. - Alex Scott 001; Paul D. Seymour (J. Graph Theory, 2020)

Active clustering for labeling training data. - Quentin Lutz; Elie de Panafieu; Maya Stein; Alex Scott 001 (NeurIPS, 2021)

Optimal labelling schemes for adjacency, comparability, and reachability. - Marthe Bonamy; Louis Esperet; Carla Groenland; Alex D. Scott (STOC, 2021)

Detecting a Long Odd Hole. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour (Comb., 2021)

Pure Pairs. II. Excluding All Subdivisions of A Graph. - Maria Chudnovsky; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (Comb., 2021)

Monochromatic Components in Edge-Coloured Graphs with Large Minimum Degree. - Hannah Guggiari; Alex Scott 001 (Electron. J. Comb., 2021)

Powers of paths in tournaments. - 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 (Comb. Probab. Comput., 2021)

Lipschitz bijections between boolean functions. - Tom Johnston; Alex D. Scott (Comb. Probab. Comput., 2021)

A note on simplicial cliques. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour; Sophie Spirkl (Discret. Math., 2021)

Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour (J. Comb. Theory B, 2021)

Maximising the number of cycles in graphs with forbidden subgraphs. - Natasha Morrison; Alexander Roberts; Alex D. Scott (J. Comb. Theory B, 2021)

Size reconstructibility of graphs. - Carla Groenland; Hannah Guggiari; Alex D. Scott (J. Graph Theory, 2021)

The component structure of dense random subgraphs of the hypercube. - Colin McDiarmid; Alex Scott 001; Paul Withers (Random Struct. Algorithms, 2021)

Finding a Shortest Odd Hole. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour (ACM Trans. Algorithms, 2021)

Concatenating Bipartite Graphs. - Maria Chudnovsky; Patrick Hompe; Alex Scott 001; Paul D. Seymour; Sophie Spirkl (Electron. J. Comb., 2022)

A multidimensional Ramsey Theorem. - António Girão; Gal Kronenberg; Alex Scott 001 (CoRR, 2022)

Shotgun assembly of random graphs. - Tom Johnston; Gal Kronenberg; Alexander Roberts; Alex Scott 001 (CoRR, 2022)

Reconstructing the degree sequence of a sparse graph from a partial deck. - Carla Groenland; Tom Johnston; Andrey Kupavskii; Kitty Meeks; Alex D. Scott; Jane Tan (J. Comb. Theory B, 2022)

Polynomial bounds for chromatic number II: Excluding a star-forest. - Alex D. Scott; Paul D. Seymour; Sophie Spirkl (J. Graph Theory, 2022)

Polynomial bounds for chromatic number. III. Excluding a double star. - Alex D. Scott; Paul D. Seymour; Sophie Spirkl (J. Graph Theory, 2022)

Shotgun reconstruction in the hypercube. - Michal Przykucki; Alexander Roberts; Alex Scott 001 (Random Struct. Algorithms, 2022)

A Note on Infinite Antichain Density. - Paul Balister; Emil Powierski; Alex D. Scott; Jane Tan (SIAM J. Discret. Math., 2022)

Pure Pairs VI: Excluding an Ordered Tree. - Alex Scott 001; Paul D. Seymour; Sophie Spirkl (SIAM J. Discret. Math., 2022)

Balancing Connected Colourings of Graphs. - Freddie Illingworth; Emil Powierski; Alex D. Scott; Youri Tamitegama (Electron. J. Comb., 2023)

Game Connectivity and Adaptive Dynamics. - Tom Johnston; Michael Savery; Alex Scott 001; Bassel Tarbush (CoRR, 2023)

Superpolynomial smoothed complexity of 3-FLIP in Local Max-Cut. - Lukas Michel; Alex Scott 001 (CoRR, 2023)

Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree. - Alexander D. Scott; Paul D. Seymour; Sophie Spirkl (J. Graph Theory, 2023)

Clustered colouring of graph classes with bounded treedepth or pathwidth. - Sergey Norin; Alex Scott 001; David R. Wood (Comb. Probab. Comput., 2023)

Polynomial bounds for chromatic number VI. Adding a four-vertex path. - Maria Chudnovsky; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (Eur. J. Comb., 2023)

Counting partitions of G n , 1 / 2 $$ {G}_{n,1/2} $$ with degree congruence conditions. - Paul Balister; Emil Powierski; Alex Scott 001; Jane Tan (Random Struct. Algorithms, 2023)

Pure Pairs. V. Excluding Some Long Subdivision. - Alex Scott 001; Paul D. Seymour; Sophie Spirkl (Comb., 2023)

Decomposing Random Permutations into Order-Isomorphic Subpermutations. - Carla Groenland; Tom Johnston; Dániel Korándi; Alexander Roberts; Alex D. Scott; Jane Tan (SIAM J. Discret. Math., 2023)

Pure pairs. IV. Trees in bipartite graphs. - Alex D. Scott; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2023)

Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix. - Alex Scott 001; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2023)

Best-response dynamics, playing sequences, and convergence to equilibrium in random games. - Torsten Heinrich; Yoojin Jang; Luca Mungo; Marco Pangallo; Alex Scott 001; Bassel Tarbush; Samuel C. Wiese (Int. J. Game Theory, 2023)

Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path. - Alex Scott 001; Paul D. Seymour; Sophie Spirkl (Comb., 2023)

Strengthening Rödl's theorem. - Maria Chudnovsky; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2023)

Polynomial bounds for chromatic number VII. Disjoint holes. - Maria Chudnovsky; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (J. Graph Theory, 2023)

Induced Subgraphs of Induced Subgraphs of Large Chromatic Number. - António Girão; Freddie Illingworth; Emil Powierski; Michael Savery; Alex Scott 001; Youri Tamitegama; Jane Tan (Comb., 2024)

Graphs with Arbitrary Ramsey Number and Connectivity. - Isabel Ahme; Alex Scott 001 (Electron. J. Comb., 2024)

A Note on Graphs of $k$-Colourings. - Emma Hogan; Alex Scott 001; Youri Tamitegama; Jane Tan (Electron. J. Comb., 2024)

Clique covers of H-free graphs. - Tung Nguyen 004; Alexander Scott 001; Paul D. Seymour; Stéphan Thomassé (Eur. J. Comb., 2024)

Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph. - Tung Nguyen 004; Alex Scott 001; Paul D. Seymour (J. Graph Theory, 2024)

Reconstructing a Point Set from a Random Subset of Its Pairwise Distances. - António Girão; Freddie Illingworth; Lukas Michel; Emil Powierski; Alex D. Scott (SIAM J. Discret. Math., 2024)

Pure pairs. X. Tournaments and the strong Erdős-Hajnal property. - Maria Chudnovsky; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (Eur. J. Comb., 2024)

Bipartite graphs with no K6 minor. - Maria Chudnovsky; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2024)

Induced paths in graphs without anticomplete cycles. - Tung Nguyen 004; Alex D. Scott; Paul D. Seymour (J. Comb. Theory B, 2024)

Polynomial bounds for chromatic number. V. Excluding a tree of radius two and a complete multipartite graph. - Alex D. Scott; Paul D. Seymour (J. Comb. Theory B, 2024)

On a problem of El-Zahar and Erdős. - Tung Nguyen 004; Alex D. Scott; Paul D. Seymour (J. Comb. Theory B, 2024)

Invertibility of Digraphs and Tournaments. - Noga Alon; Emil Powierski; Michael Savery; Alex D. Scott; Elizabeth Wilmer (SIAM J. Discret. Math., 2024)

Pure Pairs. IX. Transversal Trees. - Alex D. Scott; Paul D. Seymour; Sophie Theresa Spirkl (SIAM J. Discret. Math., 2024)

A Note on the Gyárfás-Sumner Conjecture. - Tung Nguyen 004; Alex Scott 001; Paul D. Seymour (Graphs Comb., 2024)

Defective coloring of hypergraphs. - António Girão; Freddie Illingworth; Alex D. Scott; David R. Wood (Random Struct. Algorithms, 2024)

Flashes and Rainbows in Tournaments. - António Girão; Freddie Illingworth; Lukas Michel; Michael Savery; Alex D. Scott (Comb., 2024)

Publisher Erratum: Flashes and Rainbows in Tournaments. - António Girão; Freddie Illingworth; Lukas Michel; Michael Savery; Alex Scott 001 (Comb., 2024)

Pure Pairs. VIII. Excluding a Sparse Graph. - Alex Scott 001; Paul D. Seymour; Sophie Spirkl (Comb., 2024)

Graphs without a 3-Connected Subgraph are 4-Colourable. - Édouard Bonnet; Carl Feghali; Tung Nguyen 004; Alex Scott 001; Paul D. Seymour; Stéphan Thomassé; Nicolas Trotignon (Electron. J. Comb., 2025)

Induced subgraph density. II. Sparse and dense sets in cographs. - Jacob Fox; Tung Nguyen 004; Alex D. Scott; Paul D. Seymour (Eur. J. Comb., 2025)

Boundary rigidity of 3D CAT(0) cube complexes. - John Haslegrave; Alex D. Scott; Youri Tamitegama; Jane Tan (Eur. J. Comb., 2025)

Induced C4-free subgraphs with large average degree. - Xiying Du; António Girão; Zach Hunter; Rose McCarty; Alex D. Scott (J. Comb. Theory B, 2025)

A counterexample to the coarse Menger conjecture. - Tung Nguyen 004; Alex D. Scott; Paul D. Seymour (J. Comb. Theory B, 2025)

Some results and problems on tournament structure. - Tung Nguyen 004; Alex Scott 001; Paul D. Seymour (J. Comb. Theory B, 2025)

Lower bounds for graph reconstruction with maximal independent set queries. - Lukas Michel; Alex D. Scott (Theor. Comput. Sci., 2025)

Subdivisions and near-linear stable sets. - Tung Nguyen 004; Alex Scott 001; Paul D. Seymour (Comb., 2025)

Trees and near-linear stable sets. - Tung Nguyen 004; Alex Scott 001; Paul D. Seymour (Comb., 2025)