| Publication | Date of Publication | Type |
|---|
| Asymptotically good local list edge colourings | 2024-10-18 | Paper |
| On the density of \(C_7\)-critical graphs | 2024-10-18 | Paper |
| Fractional coloring with local demands and applications to degree-sequence bounds on the independence number | 2024-10-08 | Paper |
| Improving the Caro-Wei bound and applications to Turán stability | 2024-09-26 | Paper |
| Edge-colouring graphs with local list sizes | 2024-01-15 | Paper |
| Asymptotically good edge correspondence colourings | 2023-10-05 | Paper |
| The list linear arboricity of graphs | 2023-10-04 | Paper |
| An improved bound for the linear arboricity conjecture | 2023-10-04 | Paper |
| On the density of critical graphs with no large cliques | 2023-10-04 | Paper |
| Exponentially Many Correspondence Colourings of Planar and Locally Planar Graphs | 2023-09-29 | Paper |
| Decomposing random regular graphs into stars | 2023-08-30 | Paper |
| Local Hadwiger's conjecture | 2023-08-10 | Paper |
| Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor | 2023-04-27 | Paper |
| Hyperbolicity Theorems for Correspondence Colouring | 2023-03-29 | Paper |
| On generalized Ramsey numbers in the non-integral regime | 2022-12-20 | Paper |
| Connectivity and choosability of graphs with no \(K_t\) minor | 2022-11-23 | Paper |
| The limit in the $(k+2, k)$-Problem of Brown, Erd\H{o}s and S\'os exists for all $k\geq 2$ | 2022-10-03 | Paper |
| On the density of \(C_7\)-critical graphs | 2022-06-30 | Paper |
| Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings | 2022-06-10 | Paper |
| Structure in sparse \(k\)-critical graphs | 2022-06-10 | Paper |
| Colouring graphs with sparse neighbourhoods: bounds and applications | 2022-04-27 | Paper |
| 11/4-colorability of subcubic triangle-free graphs | 2022-04-26 | Paper |
| Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings | 2022-04-19 | Paper |
| The chromatic number of triangle-free hypergraphs | 2022-02-06 | Paper |
| Corrigendum to: ``A local epsilon version of Reed's conjecture | 2021-09-16 | Paper |
| Five-List-Coloring Graphs on Surfaces: The Many Faces Far-Apart Generalization of Thomassen's Theorem | 2021-08-29 | Paper |
| Local girth choosability of planar graphs | 2021-08-06 | Paper |
| Bounding the number of cycles in a graph in terms of its degree sequence | 2021-02-08 | Paper |
| 3-list-coloring graphs of girth at least five on surfaces | 2021-02-03 | Paper |
| Progress towards Nash-Williams' conjecture on triangle decompositions | 2021-02-03 | Paper |
| Further Progress towards the List and Odd Versions of Hadwiger's Conjecture | 2020-10-12 | Paper |
| On decidability of hyperbolicity | 2020-10-04 | Paper |
| Fractional vertex-arboricity of planar graphs | 2020-09-25 | Paper |
| An even better Density Increment Theorem and its application to Hadwiger's Conjecture | 2020-06-25 | Paper |
| Further progress towards Hadwiger's conjecture | 2020-06-21 | Paper |
| A local epsilon version of Reed's conjecture | 2020-01-15 | Paper |
| On the clique number of the square of a line graph and its relation to maximum degree of the line graph | 2019-12-30 | Paper |
| List coloring with requests | 2019-12-30 | Paper |
| Halfway to Hadwiger's Conjecture | 2019-11-04 | Paper |
| Breaking the degeneracy barrier for coloring graphs with no $K_t$ minor | 2019-10-21 | Paper |
| Improved Bounds for Randomly Sampling Colorings via Linear Programming | 2019-10-15 | Paper |
| Bounded diameter arboricity | 2019-04-25 | Paper |
| Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces | 2019-04-07 | Paper |
| On the Density of $C_7$-Critical Graphs | 2019-03-11 | Paper |
| Planar graphs of girth at least five are square \((\delta + 2)\)-choosable | 2018-12-20 | Paper |
| Hyperbolic families and coloring graphs on surfaces | 2018-12-05 | Paper |
| Fractional coloring with local demands | 2018-11-28 | Paper |
| On the Minimal Edge Density of $K_4$-free 6-critical Graphs | 2018-11-07 | Paper |
| Asymptotically good edge correspondence colouring | 2018-08-26 | Paper |
| Random 4-regular graphs have 3-star decompositions asymptotically almost surely | 2018-06-28 | Paper |
| Chromatic index determined by fractional chromatic index | 2018-05-09 | Paper |
| Rapid mixing of Glauber dynamics for colorings below Vigoda's $11/6$ threshold | 2018-04-11 | Paper |
| Density of 5/2-critical graphs | 2018-03-16 | Paper |
| Exponentially many 4‐list‐colorings of triangle‐free graphs on surfaces | 2018-02-23 | Paper |
| Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 | 2018-02-09 | Paper |
| Characterizing 4-critical graphs with Ore-degree at most seven | 2018-02-09 | Paper |
| Corrigendum to: ``A local epsilon version of Reed's conjecture | 2018-01-18 | Paper |
| On star decompositions of random regular graphs | 2018-01-18 | Paper |
| On the list coloring version of Reed's conjecture | 2018-01-18 | Paper |
| On the Minimum Edge‐Density of 4‐Critical Graphs of Girth Five | 2017-12-01 | Paper |
| Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two | 2017-11-28 | Paper |
| Modified linear programming and class 0 bounds for graph pebbling | 2017-10-17 | Paper |
| Reconstruction of infinite matroids from their 3-connected minors | 2017-10-10 | Paper |
| On the minimum number of edges in triangle-free 5-critical graphs | 2017-09-11 | Paper |
| On the clique number of the square of a line graph and its relation to Ore-degree | 2017-08-07 | Paper |
| 5-list-coloring planar graphs with distant precolored vertices | 2016-11-25 | Paper |
| On the minimum edge-density of 5-critical triangle-free graphs | 2016-10-14 | Paper |
| Five-list-coloring graphs on surfaces. II: A linear bound for critical graphs in a disk. | 2016-04-21 | Paper |
| The structure of 2-separations of infinite matroids | 2015-12-11 | Paper |
| Five-list-coloring graphs on surfaces. I. Two lists of size two in planar graphs | 2015-03-05 | Paper |
| Pebbling Graphs of Fixed Diameter | 2014-05-22 | Paper |
| Decomposing infinite matroids into their 3-connected minors | 2013-11-01 | Paper |
| Minor-minimal non-projective planar graphs with an internal 3-separation | 2013-11-01 | Paper |
| Pebbling graphs of diameter three and four | 2013-10-10 | Paper |
| Sub-exponentially many 3-colorings of triangle-free planar graphs | 2013-10-10 | Paper |
| Six-Critical Graphs on the Klein Bottle | 2013-06-28 | Paper |
| Pebbling Graphs of Diameter Three and Four | 2013-04-19 | Paper |
| Five-coloring graphs on the Klein bottle | 2012-10-19 | Paper |
| Reducing Linear Hadwiger's Conjecture to Coloring Small Graphs | N/A | Paper |
| Refined Absorption: A New Proof of the Existence Conjecture | N/A | Paper |
| Proof of the High Girth Existence Conjecture via Refined Absorption | N/A | Paper |
| Clique Decompositions in Random Graphs via Refined Absorption | N/A | Paper |
| Thresholds for $(n,q,2)$-Steiner Systems via Refined Absorption | N/A | Paper |
