Alex D. Scott

Electron. J. Comb., 2026

The Vertex Sets of Subtrees of a Tree.

[BibT_eX]

[DOI]

Electron. J. Comb., 2026

2025

Infinite Schnyder Woods.

[BibT_eX]

[DOI]

CoRR, November, 2025

Trees and near-linear stable sets.

[BibT_eX]

[DOI]

Comb., October, 2025

Subdivisions and near-linear stable sets.

[BibT_eX]

[DOI]

Comb., August, 2025

Lower bounds for graph reconstruction with maximal independent set queries.

[BibT_eX]

[DOI]

Lukas Michel

Theor. Comput. Sci., 2025

Some results and problems on tournament structure.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2025

A counterexample to the coarse Menger conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2025

Induced C4-free subgraphs with large average degree.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2025

Boundary rigidity of 3D CAT(0) cube complexes.

[BibT_eX]

[DOI]

Eur. J. Comb., 2025

Induced subgraph density. II. Sparse and dense sets in cographs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2025

Short reachability networks.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2025

Graphs without a 3-Connected Subgraph are 4-Colourable.

[BibT_eX]

[DOI]

Electron. J. Comb., 2025

2024

Pure Pairs. VIII. Excluding a Sparse Graph.

[BibT_eX]

[DOI]

Comb., December, 2024

Publisher Erratum: Flashes and Rainbows in Tournaments.

[BibT_eX]

[DOI]

Comb., December, 2024

Flashes and Rainbows in Tournaments.

[BibT_eX]

[DOI]

Comb., June, 2024

Defective coloring of hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, May, 2024

A Note on the Gyárfás-Sumner Conjecture.

[BibT_eX]

[DOI]

Graphs Comb., April, 2024

Pure Pairs. IX. Transversal Trees.

[BibT_eX]

[DOI]

Sophie Theresa Spirkl

SIAM J. Discret. Math., March, 2024

Invertibility of Digraphs and Tournaments.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., March, 2024

On a problem of El-Zahar and Erdős.

[BibT_eX]

[DOI]

J. Comb. Theory B, March, 2024

Polynomial bounds for chromatic number. V. Excluding a tree of radius two and a complete multipartite graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, January, 2024

Induced paths in graphs without anticomplete cycles.

[BibT_eX]

[DOI]

J. Comb. Theory B, January, 2024

Bipartite graphs with no K6 minor.

[BibT_eX]

[DOI]

J. Comb. Theory B, January, 2024

Pure pairs. X. Tournaments and the strong Erdős-Hajnal property.

[BibT_eX]

[DOI]

Eur. J. Comb., January, 2024

Reconstructing a Point Set from a Random Subset of Its Pairwise Distances.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2024

Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2024

Clique covers of H-free graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

A Note on Graphs of $k$-Colourings.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

Graphs with Arbitrary Ramsey Number and Connectivity.

[BibT_eX]

[DOI]

Isabel Ahme

Electron. J. Comb., 2024

Induced Subgraphs of Induced Subgraphs of Large Chromatic Number.

[BibT_eX]

[DOI]

Comb., 2024

2023

Polynomial bounds for chromatic number VII. Disjoint holes.

[BibT_eX]

[DOI]

J. Graph Theory, November, 2023

Strengthening Rödl's theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, November, 2023

Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path.

[BibT_eX]

[DOI]

Comb., October, 2023

Best-response dynamics, playing sequences, and convergence to equilibrium in random games.

[BibT_eX]

[DOI]

Int. J. Game Theory, September, 2023

Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix.

[BibT_eX]

[DOI]

J. Comb. Theory B, July, 2023

Pure pairs. IV. Trees in bipartite graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, July, 2023

Decomposing Random Permutations into Order-Isomorphic Subpermutations.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., June, 2023

Pure Pairs. V. Excluding Some Long Subdivision.

[BibT_eX]

[DOI]

Comb., June, 2023

Counting partitions of G n , 1 / 2 $$ {G}_{n,1/2} $$ with degree congruence conditions.

[BibT_eX]

[DOI]

Random Struct. Algorithms, May, 2023

Polynomial bounds for chromatic number VI. Adding a four-vertex path.

[BibT_eX]

[DOI]

Eur. J. Comb., May, 2023

Clustered colouring of graph classes with bounded treedepth or pathwidth.

[BibT_eX]

[DOI]

Sergey Norin

David R. Wood

Comb. Probab. Comput., January, 2023

Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree.

[BibT_eX]

[DOI]

J. Graph Theory, 2023

Superpolynomial smoothed complexity of 3-FLIP in Local Max-Cut.

[BibT_eX]

[DOI]

Lukas Michel

CoRR, 2023

Game Connectivity and Adaptive Dynamics.

[BibT_eX]

[DOI]

CoRR, 2023

Balancing Connected Colourings of Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

2022

Pure Pairs VI: Excluding an Ordered Tree.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

A Note on Infinite Antichain Density.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Shotgun reconstruction in the hypercube.

[BibT_eX]

[DOI]

Michal Przykucki

Alexander Roberts

Random Struct. Algorithms, 2022

Polynomial bounds for chromatic number. III. Excluding a double star.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Polynomial bounds for chromatic number II: Excluding a star-forest.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Reconstructing the degree sequence of a sparse graph from a partial deck.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

Shotgun assembly of random graphs.

[BibT_eX]

[DOI]

CoRR, 2022

A multidimensional Ramsey Theorem.

[BibT_eX]

[DOI]

António Girão

Gal Kronenberg

CoRR, 2022

Concatenating Bipartite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

2021

Finding a Shortest Odd Hole.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

The component structure of dense random subgraphs of the hypercube.

[BibT_eX]

[DOI]

Paul Withers

Random Struct. Algorithms, 2021

Size reconstructibility of graphs.

[BibT_eX]

[DOI]

Carla Groenland

Hannah Guggiari

J. Graph Theory, 2021

Maximising the number of cycles in graphs with forbidden subgraphs.

[BibT_eX]

[DOI]

Alexander Roberts

J. Comb. Theory B, 2021

Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

A note on simplicial cliques.

[BibT_eX]

[DOI]

Discret. Math., 2021

Lipschitz bijections between boolean functions.

[BibT_eX]

[DOI]

Tom Johnston

Comb. Probab. Comput., 2021

Powers of paths in tournaments.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

Monochromatic Components in Edge-Coloured Graphs with Large Minimum Degree.

[BibT_eX]

[DOI]

Hannah Guggiari

Electron. J. Comb., 2021

Pure Pairs. II. Excluding All Subdivisions of A Graph.

[BibT_eX]

[DOI]

Comb., 2021

Detecting a Long Odd Hole.

[BibT_eX]

[DOI]

Comb., 2021

Optimal labelling schemes for adjacency, comparability, and reachability.

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Active clustering for labeling training data.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

A survey of χ-boundedness.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Induced subgraphs of graphs with large chromatic number. VI. Banana trees.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

Induced subgraphs of graphs with large chromatic number. VII. Gyárfás' complementation conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

Partitioning the vertices of a torus into isomorphic subgraphs.

[BibT_eX]

[DOI]

Marthe Bonamy

J. Comb. Theory A, 2020

Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2020

Detecting an Odd Hole.

[BibT_eX]

[DOI]

J. ACM, 2020

Induced subgraphs of graphs with large chromatic number. XIII. New brooms.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Bad news for chordal partitions.

[BibT_eX]

[DOI]

David R. Wood

J. Graph Theory, 2019

Maximising -colourings of graphs.

[BibT_eX]

[DOI]

Hannah Guggiari

J. Graph Theory, 2019

Induced subgraphs of graphs with large chromatic number. XII. Distant stars.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Near-domination in graphs.

[BibT_eX]

[DOI]

Bruce A. Reed

J. Comb. Theory A, 2019

Disjoint paths in unions of tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Induced subgraphs of graphs with large chromatic number. XI. Orientations.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

H-colouring Pt-free graphs in subexponential time.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Induced Subgraphs of Graphs With Large Chromatic Number. X. Holes of Specific Residue.

[BibT_eX]

[DOI]

Comb., 2019

Clustered Colouring in Minor-Closed Classes.

[BibT_eX]

[DOI]

Comb., 2019

Towards Erdős-Hajnal for Graphs with No 5-Hole.

[BibT_eX]

[DOI]

Comb., 2019

2018

Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

Supersaturation in posets and applications involving the container method.

[BibT_eX]

[DOI]

Jonathan A. Noel

Benny Sudakov

J. Comb. Theory A, 2018

Stability results for graphs with a critical edge.

[BibT_eX]

[DOI]

Alexander Roberts

Eur. J. Comb., 2018

How unproportional must a graph be?

[BibT_eX]

[DOI]

Humberto Naves

Oleg Pikhurko

Eur. J. Comb., 2018

Better bounds for poset dimension and boxicity.

[BibT_eX]

[DOI]

David R. Wood

CoRR, 2018

H-colouring Pt-free graphs in subexponential time.

[BibT_eX]

[DOI]

Carla Groenland

CoRR, 2018

2017

Uniform multicommodity flows in the hypercube with random edge-capacities.

[BibT_eX]

[DOI]

Paul Withers

Random Struct. Algorithms, 2017

Packing random graphs and hypergraphs.

[BibT_eX]

[DOI]

Svante Janson

Random Struct. Algorithms, 2017

On Lower Bounds for the Matching Number of Subcubic Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Maximising the number of induced cycles in a graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Saturation in the Hypercube and Bootstrap Percolation.

[BibT_eX]

[DOI]

Jonathan A. Noel

Comb. Probab. Comput., 2017

Induced Subgraphs of Graphs with Large Chromatic Number IX: Rainbow Paths.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

A Note on Intersecting Hypergraphs with Large Cover Number.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes.

[BibT_eX]

[DOI]

Comb., 2017

2016

Induced subgraphs of graphs with large chromatic number. I. Odd holes.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Disjoint dijoins.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

The parameterised complexity of list problems on graphs of bounded treewidth.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Random graphs from a block-stable class.

[BibT_eX]

[DOI]

Eur. J. Comb., 2016

Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring.

[BibT_eX]

[DOI]

Peter Jeavons

Lei Xu

Distributed Comput., 2016

2015

Intersections of hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

Intersections of random hypergraphs and tournaments.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

Disjoint induced subgraphs of the same order and size.

[BibT_eX]

[DOI]

Teeradej Kittipassorn

Bhargav P. Narayanan

Eur. J. Comb., 2015

2014

Hypergraphs of Bounded Disjointness.

[BibT_eX]

[DOI]

Elizabeth Wilmer

SIAM J. Discret. Math., 2014

For most graphs H, most H-free graphs have a linear homogeneous set.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2014

Excluding pairs of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

Uniform multicommodity flow in the hypercube with random edge capacities.

[BibT_eX]

[DOI]

Paul Withers

CoRR, 2014

On Saturated k-Sperner Systems.

[BibT_eX]

[DOI]

Jonathan A. Noel

Electron. J. Comb., 2014

2013

The complexity of Free-Flood-It on 2×n boards.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

A counterexample to a conjecture of Schwartz.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2013

Substitution and χ-boundedness.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

Tournaments and colouring.

[BibT_eX]

[DOI]

Eli Berger

Krzysztof Choromanski

J. Comb. Theory B, 2013

Feedback from nature: an optimal distributed algorithm for maximal independent set selection.

[BibT_eX]

[DOI]

Peter Jeavons

Lei Xu

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012

The minimal covering set in large tournaments.

[BibT_eX]

[DOI]

Mark Fey

Soc. Choice Welf., 2012

Excluding Induced Subdivisions of the Bull and Related Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

The complexity of flood-filling games on graphs.

[BibT_eX]

[DOI]

Fabrício Siqueira Benevides

Discret. Appl. Math., 2012

Monochromatic Cycles in 2-Coloured Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

On Ryser's conjecture.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

Spanning Trees and the Complexity of Flood-Filling Games.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011

A Bound for the Cops and Robbers Problem.

[BibT_eX]

[DOI]

Benny Sudakov

SIAM J. Discret. Math., 2011

Intersections of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Szemerédi's Regularity Lemma for Matrices and Sparse Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2011

The complexity of Free-Flood-It on 2xn boards

[BibT_eX]

[DOI]

CoRR, 2011

Cover-Decomposition and Polychromatic Numbers.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

2010

Max k-cut and judicious k-partitions.

[BibT_eX]

[DOI]

Discret. Math., 2010

Structure of random r-SAT below the pure literal threshold

[BibT_eX]

[DOI]

CoRR, 2010

2009

Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

Uniform multicommodity flow through the complete graph with random edge-capacities.

[BibT_eX]

[DOI]

David J. Aldous

Oper. Res. Lett., 2009

2007

Maximum directed cuts in acyclic digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Separating systems and oriented graphs of diameter two.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Infinite Locally Random Graphs.

[BibT_eX]

[DOI]

Pierre Charbit

Internet Math., 2007

On separating systems.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

Linear-programming design and analysis of fast algorithms for Max 2-CSP.

[BibT_eX]

[DOI]

Discret. Optim., 2007

Computational complexity of some restricted instances of 3-SAT.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2006

Reconstructing under Group Actions.

[BibT_eX]

[DOI]

Graphs Comb., 2006

Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2006

On Dependency Graphs and the Lattice Gas.

[BibT_eX]

[DOI]

Alan D. Sokal

Comb. Probab. Comput., 2006

Linear-programming design and analysis of fast algorithms for Max 2-Sat and Max 2-CSP

[BibT_eX]

[DOI]

CoRR, 2006

Polynomial Constraint Satisfaction: A Framework for Counting and Sampling CSPs and Other Problems

[BibT_eX]

[DOI]

CoRR, 2006

An LP-Designed Algorithm for Constraint Satisfaction.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

2005

Judicious partitions and related problems.

[BibT_eX]

Proceedings of the Surveys in Combinatorics, 2005

2004

Judicious partitions of bounded-degree graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

Computational Complexity of Some Restricted Instances of 3SAT

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2004

Topics in Graph Automorphisms and Reconstruction by Josef Lauri and Raffaele Scapellato, Cambridge University Press, 2003, 172 pp.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

Max Cut for Random Graphs with a Planted Partition.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

2003

Finite Subsets of the Plane are 18-Reconstructible.

[BibT_eX]

[DOI]

Luke Pebody

SIAM J. Discret. Math., 2003

Approximation Hardness of Short Symmetric Instances of MAX-3SAT.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2003

Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2003

Special Issue on Ramsey Theory.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2003

2002

Problems and results on judicious partitions.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2002

A Note on Cycle Lengths in Graphs.

[BibT_eX]

[DOI]

Ronald J. Gould

Graphs Comb., 2002

2001

On Induced Subgraphs with All Degrees Odd.

[BibT_eX]

[DOI]

Graphs Comb., 2001

Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial.

[BibT_eX]

[DOI]

Eur. J. Comb., 2001

2000

Subdivisions of Transitive Tournaments.

[BibT_eX]

[DOI]

Eur. J. Comb., 2000

Judicious Partitions of 3-uniform Hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2000

1999

Induced Cycles and Chromatic Number.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

Another Simple Proof of a Theorem of Milner.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1999

Reconstructing Subsets of Reals.

[BibT_eX]

[DOI]

Electron. J. Comb., 1999

Exact Bounds for Judicious Partitions of Graphs.

[BibT_eX]

[DOI]

Comb., 1999

1998

Reconstructing Subsets of Zn.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1998

1997

Induced trees in graphs of large chromatic number.

[BibT_eX]

[DOI]

J. Graph Theory, 1997

Judicious Partitions of Hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1997

On graph decompositions modulo k.

[BibT_eX]

[DOI]

Discret. Math., 1997

Reconstructing sequences.

[BibT_eX]

[DOI]

Discret. Math., 1997

Independent sets and repeated degrees.

[BibT_eX]

[DOI]

Discret. Math., 1997

All trees contain a large induced subgraph having all degrees 1 (mod k).

[BibT_eX]

[DOI]

Discret. Math., 1997

Better Bounds for Perpetual Gossiping.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

1996

A Proof of a Conjecture of Bondy Concerning Paths in Weighted Digraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1996

1995

Every tree contains a large induced subgraph with all degrees odd.

[BibT_eX]

[DOI]

Discret. Math., 1995

1992

Large Induced Subgraphs with All Degrees Odd.

[BibT_eX]

[DOI]