Alex D. Scott

85 papers A* 1A 1Journal 82Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Game connectivity and adaptive dynamics in many-action games.
CoRR
Tom Johnston, Michael Savery, Alex D. Scott, Bassel Tarbush
2025 J jnl
A counterexample to the coarse Menger conjecture.
J. Comb. Theory B
Tung Nguyen, Alex D. Scott, Paul D. Seymour
2025 J jnl
Boundary rigidity of 3D CAT(0) cube complexes.
Eur. J. Comb.
John Haslegrave, Alex D. Scott, Youri Tamitegama, Jane Tan
2025 J jnl
Induced C4-free subgraphs with large average degree.
J. Comb. Theory B
Xiying Du, António Girão, Zach Hunter, Rose McCarty, Alex D. Scott
2025 J jnl
Induced subgraph density. II. Sparse and dense sets in cographs.
Eur. J. Comb.
Jacob Fox, Tung Nguyen, Alex D. Scott, Paul D. Seymour
2025 J jnl
Lower bounds for graph reconstruction with maximal independent set queries.
Theor. Comput. Sci.
Lukas Michel, Alex D. Scott
2025 J jnl
Short reachability networks.
Discret. Math. Theor. Comput. Sci.
Carla Groenland, Tom Johnston, Jamie Radcliffe, Alex D. Scott
2024 J jnl
Bipartite graphs with no
J. Comb. Theory B
Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2024 J jnl
Defective coloring of hypergraphs.
Random Struct. Algorithms
António Girão, Freddie Illingworth, Alex D. Scott, David R. Wood
2024 J jnl
Flashes and Rainbows in Tournaments.
Comb.
António Girão, Freddie Illingworth, Lukas Michel, Michael Savery, Alex D. Scott
2024 J jnl
Induced paths in graphs without anticomplete cycles.
J. Comb. Theory B
Tung Nguyen, Alex D. Scott, Paul D. Seymour
2024 J jnl
Invertibility of Digraphs and Tournaments.
SIAM J. Discret. Math.
Noga Alon, Emil Powierski, Michael Savery, Alex D. Scott, Elizabeth Wilmer
2024 J jnl
Lower bounds for graph reconstruction with maximal independent set queries.
CoRR
Lukas Michel, Alex D. Scott
2024 J jnl
On a problem of El-Zahar and Erdős.
J. Comb. Theory B
Tung Nguyen, Alex D. Scott, Paul D. Seymour
2024 J jnl
Polynomial bounds for chromatic number. V. Excluding a tree of radius two and a complete multipartite graph.
J. Comb. Theory B
Alex D. Scott, Paul D. Seymour
2024 J jnl
Pure Pairs. IX. Transversal Trees.
SIAM J. Discret. Math.
Alex D. Scott, Paul D. Seymour, Sophie Theresa Spirkl
2024 J jnl
Pure pairs. X. Tournaments and the strong Erdős-Hajnal property.
Eur. J. Comb.
Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2024 J jnl
Reconstructing a Point Set from a Random Subset of Its Pairwise Distances.
SIAM J. Discret. Math.
António Girão, Freddie Illingworth, Lukas Michel, Emil Powierski, Alex D. Scott
2023 J jnl
Balancing Connected Colourings of Graphs.
Electron. J. Comb.
Freddie Illingworth, Emil Powierski, Alex D. Scott, Youri Tamitegama
2023 J jnl
Decomposing Random Permutations into Order-Isomorphic Subpermutations.
SIAM J. Discret. Math.
Carla Groenland, Tom Johnston, Dániel Korándi, Alexander Roberts, Alex D. Scott, Jane Tan
2023 J jnl
Polynomial bounds for chromatic number VI. Adding a four-vertex path.
Eur. J. Comb.
Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2023 J jnl
Polynomial bounds for chromatic number VII. Disjoint holes.
J. Graph Theory
Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2023 J jnl
Pure pairs. IV. Trees in bipartite graphs.
J. Comb. Theory B
Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2023 J jnl
Strengthening Rödl's theorem.
J. Comb. Theory B
Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2022 J jnl
A Note on Infinite Antichain Density.
SIAM J. Discret. Math.
Paul Balister, Emil Powierski, Alex D. Scott, Jane Tan
2022 J jnl
Polynomial bounds for chromatic number II: Excluding a star-forest.
J. Graph Theory
Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2022 J jnl
Polynomial bounds for chromatic number. III. Excluding a double star.
J. Graph Theory
Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2022 J jnl
Reconstructing the degree sequence of a sparse graph from a partial deck.
J. Comb. Theory B
Carla Groenland, Tom Johnston, Andrey Kupavskii, Kitty Meeks, Alex D. Scott, Jane Tan
2021 J jnl
Lipschitz bijections between boolean functions.
Comb. Probab. Comput.
Tom Johnston, Alex D. Scott
2021 J jnl
Maximising the number of cycles in graphs with forbidden subgraphs.
J. Comb. Theory B
Natasha Morrison, Alexander Roberts, Alex D. Scott
2021 A* conf
Optimal labelling schemes for adjacency, comparability, and reachability.
STOC
Marthe Bonamy, Louis Esperet, Carla Groenland, Alex D. Scott
2021 J jnl
Powers of paths in tournaments.
Comb. Probab. Comput.
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
2021 J jnl
Pure Pairs. II. Excluding All Subdivisions of A Graph.
Comb.
Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2021 J jnl
Size reconstructibility of graphs.
J. Graph Theory
Carla Groenland, Hannah Guggiari, Alex D. Scott
2020 J jnl
Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces.
CoRR
Marthe Bonamy, Nicolas Bousquet, Louis Esperet, Carla Groenland, Chun-Hung Liu, François Pirot, Alex D. Scott
2020 J jnl
Optimal labelling schemes for adjacency, comparability and reachability.
CoRR
Marthe Bonamy, Louis Esperet, Carla Groenland, Alex D. Scott
2019 J jnl
H-colouring Pt-free graphs in subexponential time.
Discret. Appl. Math.
Carla Groenland, Karolina Okrasa, Pawel Rzazewski, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2019 J jnl
Induced Subgraphs of Graphs With Large Chromatic Number. X. Holes of Specific Residue.
Comb.
Alex D. Scott, Paul D. Seymour
2019 J jnl
Towards Erdős-Hajnal for Graphs with No 5-Hole.
Comb.
Maria Chudnovsky, Jacob Fox, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2017 J jnl
A Note on Intersecting Hypergraphs with Large Cover Number.
Electron. J. Comb.
Penny E. Haxell, Alex D. Scott
2016 J jnl
Feedback from Nature: Simple Randomised Distributed Algorithms for Maximal Independent Set Selection and Greedy Colouring.
CoRR
Peter Jeavons, Alex D. Scott, Lei Xu
2015 J jnl
Intersections of hypergraphs.
J. Comb. Theory B
Béla Bollobás, Alex D. Scott
2015 J jnl
Intersections of random hypergraphs and tournaments.
Eur. J. Comb.
Béla Bollobás, Alex D. Scott
2014 J jnl
For most graphs
Random Struct. Algorithms
Ross J. Kang, Colin McDiarmid, Bruce A. Reed, Alex D. Scott
2014 J jnl
On Saturated k-Sperner Systems.
CoRR
Natasha Morrison, Jonathan A. Noel, Alex D. Scott
2014 J jnl
Uniform multicommodity flow in the hypercube with random edge capacities.
CoRR
Colin McDiarmid, Alex D. Scott, Paul Withers
2013 J jnl
Cover-Decomposition and Polychromatic Numbers.
SIAM J. Discret. Math.
Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott
2012 J jnl
On Ryser's conjecture.
Electron. J. Comb.
Penny E. Haxell, Alex D. Scott
2011 A conf
Cover-Decomposition and Polychromatic Numbers.
ESA
Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott
2011 J jnl
Intersections of graphs.
J. Graph Theory
Béla Bollobás, Alex D. Scott
2010 J jnl
Max k-cut and judicious k-partitions.
Discret. Math.
Béla Bollobás, Alex D. Scott
2009 J jnl
Uniform multicommodity flow through the complete graph with random edge-capacities.
Oper. Res. Lett.
David J. Aldous, Colin McDiarmid, Alex D. Scott
2007 J jnl
Infinite Locally Random Graphs.
Internet Math.
Pierre Charbit, Alex D. Scott
2007 J jnl
Maximum directed cuts in acyclic digraphs.
J. Graph Theory
Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott
2007 J jnl
On separating systems.
Eur. J. Comb.
Béla Bollobás, Alex D. Scott
2007 J jnl
Separating systems and oriented graphs of diameter two.
J. Comb. Theory B
Béla Bollobás, Alex D. Scott
2006 J jnl
Reconstructing under Group Actions.
Graphs Comb.
A. J. Radcliffe, Alex D. Scott
2004 J jnl
Judicious partitions of bounded-degree graphs.
J. Graph Theory
Béla Bollobás, Alex D. Scott
2004 J jnl
Max Cut for Random Graphs with a Planted Partition.
Comb. Probab. Comput.
Béla Bollobás, Alex D. Scott
2003 J jnl
Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT
Electron. Colloquium Comput. Complex.
Piotr Berman, Marek Karpinski, Alex D. Scott
2003 J jnl
Approximation Hardness of Short Symmetric Instances of MAX-3SAT.
Electron. Colloquium Comput. Complex.
Piotr Berman, Marek Karpinski, Alex D. Scott
2003 — conf
Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances.
RANDOM-APPROX
Alex D. Scott, Gregory B. Sorkin
2003 J jnl
Finite Subsets of the Plane are 18-Reconstructible.
SIAM J. Discret. Math.
Luke Pebody, A. J. Radcliffe, Alex D. Scott
2003 J jnl
Special Issue on Ramsey Theory.
Comb. Probab. Comput.
Béla Bollobás, Graham R. Brightwell, Yoshiharu Kohayakawa, Imre Leader, Alex D. Scott
2002 J jnl
A Note on Cycle Lengths in Graphs.
Graphs Comb.
Ronald J. Gould, Penny E. Haxell, Alex D. Scott
2002 J jnl
Problems and results on judicious partitions.
Random Struct. Algorithms
Béla Bollobás, Alex D. Scott
2001 J jnl
Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial.
Eur. J. Comb.
Paul N. Balister, Béla Bollobás, Oliver Riordan, Alex D. Scott
2001 J jnl
On Induced Subgraphs with All Degrees Odd.
Graphs Comb.
Alex D. Scott
2000 J jnl
Judicious Partitions of 3-uniform Hypergraphs.
Eur. J. Comb.
Béla Bollobás, Alex D. Scott
2000 J jnl
Subdivisions of Transitive Tournaments.
Eur. J. Comb.
Alex D. Scott
1999 J jnl
Another Simple Proof of a Theorem of Milner.
J. Comb. Theory A
Alex D. Scott
1999 J jnl
Exact Bounds for Judicious Partitions of Graphs.
Comb.
Béla Bollobás, Alex D. Scott
1999 J jnl
Induced Cycles and Chromatic Number.
J. Comb. Theory B
Alex D. Scott
1999 J jnl
Reconstructing Subsets of Reals.
Electron. J. Comb.
A. J. Radcliffe, Alex D. Scott
1998 J jnl
Reconstructing Subsets of Z
J. Comb. Theory A
A. J. Radcliffe, Alex D. Scott
1997 J jnl
All trees contain a large induced subgraph having all degrees 1 (mod k).
Discret. Math.
David M. Berman, A. J. Radcliffe, Alex D. Scott, Hong Wang, Larry Wargo
1997 J jnl
Better Bounds for Perpetual Gossiping.
Discret. Appl. Math.
Alex D. Scott
1997 J jnl
Independent sets and repeated degrees.
Discret. Math.
Béla Bollobás, Alex D. Scott
1997 J jnl
Induced trees in graphs of large chromatic number.
J. Graph Theory
Alex D. Scott
1997 J jnl
Judicious Partitions of Hypergraphs.
J. Comb. Theory A
Béla Bollobás, Alex D. Scott
1997 J jnl
On graph decompositions modulo k.
Discret. Math.
Alex D. Scott
1997 J jnl
Reconstructing sequences.
Discret. Math.
Alex D. Scott
1996 J jnl
A Proof of a Conjecture of Bondy Concerning Paths in Weighted Digraphs.
J. Comb. Theory B
Béla Bollobás, Alex D. Scott
1995 J jnl
Every tree contains a large induced subgraph with all degrees odd.
Discret. Math.
A. J. Radcliffe, Alex D. Scott
1992 J jnl
Large Induced Subgraphs with All Degrees Odd.
Comb. Probab. Comput.
Alex D. Scott