| Publication | Date of Publication | Type |
|---|
| Induced subgraphs of induced subgraphs of large chromatic number | 2024-04-09 | Paper |
| Defective coloring of hypergraphs | 2024-03-25 | Paper |
| Graphs of large chromatic number | 2024-03-20 | Paper |
| Pure Pairs. IX. Transversal Trees | 2024-02-07 | Paper |
| Bipartite graphs with no \(K_6\) minor | 2024-01-29 | Paper |
| Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph | 2024-01-29 | Paper |
| Invertibility of Digraphs and Tournaments | 2024-01-23 | Paper |
| On a problem of El-Zahar and Erdős | 2024-01-15 | Paper |
| Induced subgraph density. VII. The five-vertex path | 2023-12-23 | Paper |
| Optimal labelling schemes for adjacency, comparability, and reachability | 2023-11-14 | Paper |
| Graphs with arbitrary Ramsey number and connectivity | 2023-11-03 | Paper |
| Pure pairs. X. Tournaments and the strong Erdős-Hajnal property | 2023-10-25 | Paper |
| Counting partitions of Gn,1/2$$ {G}_{n,1/2} $$ with degree congruence conditions | 2023-10-19 | Paper |
| The component structure of dense random subgraphs of the hypercube | 2023-10-12 | Paper |
| Shotgun reconstruction in the hypercube | 2023-10-12 | Paper |
| Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree | 2023-10-06 | Paper |
| Polynomial bounds for chromatic number II: Excluding a star‐forest | 2023-10-05 | Paper |
| Polynomial bounds for chromatic number. III. Excluding a double star | 2023-10-05 | Paper |
| Polynomial bounds for chromatic number VII. Disjoint holes | 2023-10-05 | Paper |
| Pure pairs. V: Excluding some long subdivision | 2023-10-04 | Paper |
| Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path | 2023-10-04 | Paper |
| Size reconstructibility of graphs | 2023-09-29 | Paper |
| Best-response dynamics, playing sequences, and convergence to equilibrium in random games | 2023-09-25 | Paper |
| Erdős–Hajnal for graphs with no 5‐hole | 2023-09-20 | Paper |
| Strengthening Rödl's theorem | 2023-09-19 | Paper |
| Game Connectivity and Adaptive Dynamics | 2023-09-19 | Paper |
| Boundary rigidity of 3D CAT(0) cube complexes | 2023-09-08 | Paper |
| Induced subgraph density. V. All paths approach Erdos-Hajnal | 2023-07-27 | Paper |
| Induced $C_4$-free subgraphs with large average degree | 2023-07-17 | Paper |
| Induced subgraph density. II. Sparse and dense sets in cographs | 2023-07-03 | Paper |
| Decomposing Random Permutations into Order-Isomorphic Subpermutations | 2023-06-27 | Paper |
| Parking on the integers | 2023-06-05 | Paper |
| Some results and problems on tournament structure | 2023-06-04 | Paper |
| Flashes and rainbows in tournaments | 2023-05-22 | Paper |
| The structure and density of $k$-product-free sets in the free semigroup | 2023-05-09 | Paper |
| Pure pairs. IV: Trees in bipartite graphs | 2023-05-02 | Paper |
| Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix | 2023-05-02 | Paper |
| Polynomial bounds for chromatic number VI. Adding a four-vertex path | 2023-04-27 | Paper |
| Balancing connected colourings of graphs | 2023-04-19 | Paper |
| Clustered colouring of graph classes with bounded treedepth or pathwidth | 2023-04-03 | Paper |
| Lipschitz bijections between boolean functions | 2023-03-30 | Paper |
| Powers of paths in tournaments | 2023-03-30 | Paper |
| Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph | 2023-03-21 | Paper |
| Reconstructing a point set from a random subset of its pairwise distances | 2023-01-26 | Paper |
| Counting graphic sequences via integrated random walks | 2023-01-17 | Paper |
| Shotgun assembly of random graphs | 2022-11-25 | Paper |
| A multidimensional Ramsey Theorem | 2022-10-17 | Paper |
| Reconstructing the degree sequence of a sparse graph from a partial deck | 2022-09-23 | Paper |
| Perfect shuffling with fewer lazy transpositions | 2022-08-13 | Paper |
| Short reachability networks | 2022-08-13 | Paper |
| Improved bounds for 1-independent percolation on $\mathbb{Z}^n$ | 2022-06-24 | Paper |
| Concatenating bipartite graphs | 2022-06-13 | Paper |
| Balancing connected colourings of graphs | 2022-05-10 | Paper |
| Pure pairs. III. Sparse graphs with no polynomial‐sized anticomplete pairs | 2022-03-31 | Paper |
| A survey of χ‐boundedness | 2022-03-31 | Paper |
| A Note on Infinite Antichain Density | 2022-03-15 | Paper |
| Combinatorics in the exterior algebra and the Bollobás Two Families Theorem | 2022-02-24 | Paper |
| Polynomial bounds for chromatic number VI. Adding a four-vertex path | 2022-02-21 | Paper |
| Finding a Shortest Odd Hole | 2022-02-16 | Paper |
| Exact stability for Turán’s Theorem | 2022-02-10 | Paper |
| Pure pairs. VIII. Excluding a sparse graph | 2022-01-11 | Paper |
| Pure Pairs VI: Excluding an Ordered Tree | 2022-01-07 | Paper |
| Active clustering for labeling training data | 2021-10-27 | Paper |
| Separation dimension and degree | 2021-09-14 | Paper |
| A universal exponent for homeomorphs | 2021-08-24 | Paper |
| A note on simplicial cliques | 2021-07-08 | Paper |
| Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings | 2021-07-06 | Paper |
| Detecting a long odd hole | 2021-06-25 | Paper |
| Powers of paths and cycles in tournaments | 2021-05-26 | Paper |
| Product structure of graphs with an excluded minor | 2021-04-14 | Paper |
| Reconstruction from smaller cards | 2021-03-24 | Paper |
| Exceptional graphs for the random walk | 2021-02-15 | Paper |
| Maximising the number of cycles in graphs with forbidden subgraphs | 2021-02-03 | Paper |
| Monochromatic components in edge-coloured graphs with large minimum degree | 2021-01-29 | Paper |
| Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces | 2020-12-04 | Paper |
| Pure pairs. I: Trees and linear anticomplete pairs | 2020-12-03 | Paper |
| Detecting an Odd Hole | 2020-11-11 | Paper |
| Induced subgraphs of graphs with large chromatic number. VI. Banana trees | 2020-09-24 | Paper |
| Proof of the Kalai-Meshulam conjecture | 2020-09-15 | Paper |
| Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺(𝑛,𝑚) and 𝐺(𝑛,𝑝) | 2020-07-17 | Paper |
| Surfaces have (asymptotic) dimension 2 | 2020-07-07 | Paper |
| Partitioning the vertices of a torus into isomorphic subgraphs | 2020-04-27 | Paper |
| Finding a shortest odd hole | 2020-04-24 | Paper |
| Induced subgraphs of graphs with large chromatic number. VII: Gyárfás' complementation conjecture | 2020-04-07 | Paper |
| Better bounds for poset dimension and boxicity | 2020-02-26 | Paper |
| Clustered colouring in minor-closed classes | 2020-02-26 | Paper |
| Towards Erdős-Hajnal for graphs with no 5-hole | 2020-01-17 | Paper |
| Induced subgraphs of graphs with large chromatic number. X. Holes of specific residue | 2020-01-17 | Paper |
| Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes | 2020-01-15 | Paper |
| Induced subgraphs of graphs with large chromatic number. XII. Distant stars | 2019-12-30 | Paper |
| Induced subgraphs of graphs with large chromatic number. XIII. New brooms | 2019-11-28 | Paper |
| Maximising ‐colourings of graphs | 2019-10-31 | Paper |
| \(H\)-colouring \(P_t\)-free graphs in subexponential time | 2019-09-05 | Paper |
| Near-domination in graphs | 2019-06-25 | Paper |
| Bad News for Chordal Partitions | 2019-06-14 | Paper |
| Disjoint paths in unions of tournaments | 2019-02-08 | Paper |
| Balancing sums of random vectors | 2019-01-09 | Paper |
| Induced subgraphs of graphs with large chromatic number. XI. Orientations | 2018-12-20 | Paper |
| A logarithmic bound for the chromatic number of the associahedron | 2018-11-21 | Paper |
| Sparse graphs with no polynomial-sized anticomplete pairs | 2018-09-28 | Paper |
| Stability results for graphs with a critical edge | 2018-09-07 | Paper |
| How unproportional must a graph be? | 2018-08-24 | Paper |
| Size reconstructibility of graphs | 2018-07-31 | Paper |
| Induced subgraphs of graphs with large chromatic number. IV: Consecutive holes | 2018-07-24 | Paper |
| Induced subgraphs of graphs with large chromatic number. III: Long holes | 2018-07-23 | Paper |
| Approximating the position of a hidden agent in a graph | 2018-05-11 | Paper |
| On a problem of Erdős and Moser | 2018-01-05 | Paper |
| Supersaturation in posets and applications involving the container method | 2017-11-09 | Paper |
| Saturation in the Hypercube and Bootstrap Percolation | 2017-10-10 | Paper |
| Packing random graphs and hypergraphs | 2017-09-26 | Paper |
| A note on intersecting hypergraphs with large cover number | 2017-09-08 | Paper |
| Maximising the number of induced cycles in a graph | 2017-08-22 | Paper |
| Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths | 2017-07-13 | Paper |
| On Lower Bounds for the Matching Number of Subcubic Graphs | 2017-07-05 | Paper |
| Uniform multicommodity flows in the hypercube with random edge‐capacities | 2017-06-02 | Paper |
| Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring | 2017-04-04 | Paper |
| The parameterised complexity of list problems on graphs of bounded treewidth | 2016-11-18 | Paper |
| Induced subgraphs of graphs with large chromatic number. I. Odd holes | 2016-10-12 | Paper |
| Random graphs from a block-stable class | 2016-08-16 | Paper |
| Disjoint dijoins | 2016-06-03 | Paper |
| Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures | 2016-03-14 | Paper |
| Disjoint induced subgraphs of the same order and size | 2015-06-18 | Paper |
| Feedback from nature | 2015-03-02 | Paper |
| Spanning trees and the complexity of flood-filling games | 2015-01-21 | Paper |
| Complete monotonicity for inverse powers of some combinatorially defined polynomials | 2014-12-17 | Paper |
| Disjoint paths in tournaments | 2014-12-12 | Paper |
| Intersections of hypergraphs | 2014-11-21 | Paper |
| Intersections of random hypergraphs and tournaments | 2014-11-19 | Paper |
| For most graphs \(H\), most \(H\)-free graphs have a linear homogeneous set | 2014-11-17 | Paper |
| Substitution and \(\chi\)-boundedness | 2014-10-13 | Paper |
| On saturated \(k\)-Sperner systems | 2014-09-04 | Paper |
| Excluding pairs of graphs | 2014-08-28 | Paper |
| Hypergraphs of Bounded Disjointness | 2014-06-19 | Paper |
| A counterexample to a conjecture of Schwartz | 2014-05-30 | Paper |
| The complexity of free-flood-it on \(2\times n\) boards | 2013-12-19 | Paper |
| Tournaments and colouring | 2013-01-18 | Paper |
| Excluding Induced Subdivisions of the Bull and Related Graphs | 2012-09-12 | Paper |
| On Ryser's conjecture | 2012-06-12 | Paper |
| The complexity of flood-filling games on graphs | 2012-05-30 | Paper |
| A Bound for the Cops and Robbers Problem | 2012-03-15 | Paper |
| The minimal covering set in large tournaments | 2012-01-13 | Paper |
| Monochromatic cycles and the monochromatic circumference in 2-coloured graphs | 2011-07-26 | Paper |
| Szemerédi's Regularity Lemma for Matrices and Sparse Graphs | 2011-05-11 | Paper |
| Intersections of graphs | 2011-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3078209 | 2011-02-18 | Paper |
| Covering numbers for graphs and hypergraphs | 2010-09-29 | Paper |
| Structure of random r-SAT below the pure literal threshold | 2010-08-06 | Paper |
| Max \(k\)-cut and judicious \(k\)-partitions | 2010-07-07 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Some variants of the exponential formula, with application to the multivariate Tutte polynomial (alias Potts model) | 2010-01-29 | Paper |
| Uniform multicommodity flow through the complete graph with random edge-capacities | 2009-11-17 | Paper |
| On the concentration of the chromatic number of random graphs | 2008-06-02 | Paper |
| Linear-programming design and analysis of fast algorithms for Max 2-CSP | 2008-05-14 | Paper |
| Infinite Locally Random Graphs | 2008-04-29 | Paper |
| An LP-Designed Algorithm for Constraint Satisfaction | 2008-03-11 | Paper |
| Maximum directed cuts in acyclic digraphs | 2007-06-11 | Paper |
| Computational complexity of some restricted instances of 3-SAT | 2007-04-13 | Paper |
| On separating systems | 2007-04-10 | Paper |
| Separating systems and oriented graphs of diameter two | 2007-02-13 | Paper |
| Partitions and orientations of the Rado graph | 2007-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3416246 | 2007-01-19 | Paper |
| Reconstructing under group actions. | 2007-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5477810 | 2006-06-29 | Paper |
| On Dependency Graphs and the Lattice Gas | 2006-03-13 | Paper |
| Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time | 2006-03-13 | Paper |
| Reversals and Transpositions Over Finite Alphabets | 2005-09-16 | Paper |
| The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma | 2005-08-08 | Paper |
| Max Cut for Random Graphs with a Planted Partition | 2005-04-18 | Paper |
| Judicious partitions of bounded‐degree graphs | 2004-08-04 | Paper |
| Finite Subsets of the Plane are 18-Reconstructible | 2004-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4550236 | 2003-07-17 | Paper |
| A note on cycle lengths in graphs | 2003-03-25 | Paper |
| Problems and results on judicious partitions | 2003-03-19 | Paper |
| On induced subgraphs with all degree odd | 2002-01-09 | Paper |
| Alternating knot diagrams, Euler circuits and the interlace polynomial | 2001-09-18 | Paper |
| Subdivisions of transitive tournaments | 2001-08-02 | Paper |
| On graph decompositions modulo \(k\) | 2001-01-02 | Paper |
| Another simple proof of a theorem of Milner | 2000-06-04 | Paper |
| Exact bounds for judicious partitions of graphs | 2000-05-14 | Paper |
| Judicious partitions of 3-uniform hypergraphs | 2000-04-26 | Paper |
| Induced cycles and chromatic number | 1999-12-20 | Paper |
| Reconstructing subsets of reals | 1999-03-31 | Paper |
| Reconstructing subsets of \(\mathbb{Z}_n\) | 1999-03-30 | Paper |
| All trees contain a large induced subgraph having all degrees 1 (mod \(k\)) | 1998-07-06 | Paper |
| Reconstructing sequences | 1998-06-29 | Paper |
| Better bounds for perpetual gossiping | 1998-03-10 | Paper |
| Independent sets and repeated degrees | 1998-02-16 | Paper |
| Judicious partitions of hypergraphs | 1998-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3129824 | 1997-04-22 | Paper |
| A proof of a conjecture of Bondy concerning paths in weighted digraphs | 1996-10-14 | Paper |
| Every tree contains a large induced subgraph with all degrees odd | 1995-09-28 | Paper |
| Judicious partitions of graphs | 1994-09-05 | Paper |
| Large Induced Subgraphs with All Degrees Odd | 1994-05-05 | Paper |
