| Publication | Date of Publication | Type |
|---|
Fractional clique decompositions of dense hypergraphs
Bulletin of the London Mathematical Society | 2026-06-08 | Paper |
On generalized Ramsey numbers in the non-integral regime
The Electronic Journal of Combinatorics | 2026-04-29 | Paper |
Hyperbolicity theorems for correspondence colouring
Journal of Combinatorial Theory. Series B | 2025-09-16 | Paper |
Decomposing random regular graphs into stars
European Journal of Combinatorics | 2025-09-16 | Paper |
| Linear-time and efficient distributed algorithms for list coloring graphs on surfaces | 2025-08-12 | Paper |
On decidability of hyperbolicity
Combinatorica | 2025-06-19 | Paper |
11/4-colorability of subcubic triangle-free graphs
Advances in Combinatorics | 2025-05-21 | Paper |
Sub-exponentially many 3-colorings of triangle-free planar graphs
Journal of Combinatorial Theory. Series B | 2025-05-15 | Paper |
Local girth choosability of planar graphs
Advances in Combinatorics | 2025-04-29 | Paper |
Reducing linear Hadwiger's conjecture to coloring small graphs
Journal of the American Mathematical Society | 2025-03-06 | Paper |
Asymptotically good local list edge colourings
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
On the density of C₇-critical graphs
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
Journal of Combinatorial Theory. Series B | 2024-10-08 | Paper |
Improving the Caro-Wei bound and applications to Turán stability
Discrete Applied Mathematics | 2024-09-26 | Paper |
Edge-colouring graphs with local list sizes
Journal of Combinatorial Theory. Series B | 2024-01-15 | Paper |
Asymptotically good edge correspondence colourings
Journal of Graph Theory | 2023-10-05 | Paper |
An improved bound for the linear arboricity conjecture
Combinatorica | 2023-10-04 | Paper |
On the density of critical graphs with no large cliques
Combinatorica | 2023-10-04 | Paper |
The list linear arboricity of graphs
Journal of Graph Theory | 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
Journal of Combinatorial Theory. Series B | 2023-08-10 | Paper |
Breaking the degeneracy barrier for coloring graphs with no K_t minor
Advances in Mathematics | 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
Journal of Combinatorial Theory. Series B | 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
Combinatorica | 2022-06-30 | Paper |
Structure in sparse k-critical graphs
Journal of Combinatorial Theory. Series B | 2022-06-10 | Paper |
Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings
Journal of Combinatorial Theory. Series B | 2022-06-10 | Paper |
Colouring graphs with sparse neighbourhoods: bounds and applications
Journal of Combinatorial Theory. Series B | 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''
Journal of Combinatorial Theory. Series B | 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
European Journal of Combinatorics | 2021-02-08 | Paper |
Progress towards Nash-Williams' conjecture on triangle decompositions
Journal of Combinatorial Theory. Series B | 2021-02-03 | Paper |
3-list-coloring graphs of girth at least five on surfaces
Journal of Combinatorial Theory. Series B | 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
Journal of Combinatorial Theory. Series B | 2020-01-15 | Paper |
List coloring with requests
Journal of Graph Theory | 2019-12-30 | Paper |
On the clique number of the square of a line graph and its relation to maximum degree of the line graph
Journal of Graph Theory | 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
(available as arXiv preprint) | 2019-10-21 | Paper |
Improved bounds for randomly sampling colorings via linear programming
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Bounded diameter arboricity
Journal of Graph Theory | 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₇-Critical Graphs
(available as arXiv preprint) | 2019-03-11 | Paper |
Planar graphs of girth at least five are square ( + 2)-choosable
Journal of Combinatorial Theory. Series B | 2018-12-20 | Paper |
Hyperbolic families and coloring graphs on surfaces
Transactions of the American Mathematical Society, Series B | 2018-12-05 | Paper |
| Fractional coloring with local demands | 2018-11-28 | Paper |
| On the Minimal Edge Density of K₄-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
European Journal of Combinatorics | 2018-06-28 | Paper |
Chromatic index determined by fractional chromatic index
Journal of Combinatorial Theory. Series B | 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
Combinatorica | 2018-03-16 | Paper |
Exponentially many 4-list-colorings of triangle-free graphs on surfaces
Journal of Graph Theory | 2018-02-23 | Paper |
Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
Journal of Combinatorial Theory. Series B | 2018-02-09 | Paper |
Characterizing 4-critical graphs with Ore-degree at most seven
Journal of Combinatorial Theory. Series B | 2018-02-09 | Paper |
A local epsilon version of Reed's conjecture
Electronic Notes in Discrete Mathematics | 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
Journal of Graph Theory | 2017-12-01 | Paper |
Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two
Journal of Combinatorial Theory. Series B | 2017-11-28 | Paper |
Modified linear programming and class 0 bounds for graph pebbling
Journal of Combinatorial Optimization | 2017-10-17 | Paper |
Reconstruction of infinite matroids from their 3-connected minors
European Journal of Combinatorics | 2017-10-10 | Paper |
Reconstruction of infinite matroids from their 3-connected minors
European Journal of Combinatorics | 2017-10-10 | Paper |
On the minimum number of edges in triangle-free 5-critical graphs
European Journal of Combinatorics | 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
Journal of Combinatorial Theory. Series B | 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.
Journal of Combinatorial Theory. Series B | 2016-04-21 | Paper |
The structure of 2-separations of infinite matroids
Journal of Combinatorial Theory. Series B | 2015-12-11 | Paper |
Five-list-coloring graphs on surfaces. I. Two lists of size two in planar graphs
Journal of Combinatorial Theory. Series B | 2015-03-05 | Paper |
Pebbling graphs of fixed diameter
Journal of Graph Theory | 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
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Sub-exponentially many 3-colorings of triangle-free planar graphs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Six-Critical Graphs on the Klein Bottle
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
Pebbling graphs of diameter three and four
Journal of Graph Theory | 2013-04-19 | Paper |
Five-coloring graphs on the Klein bottle
Journal of Combinatorial Theory. Series B | 2012-10-19 | Paper |
Thresholds for (n,q,2)-Steiner Systems via Refined Absorption
(available as arXiv preprint) | N/A | Paper |
Clique Decompositions in Random Graphs via Refined Absorption
(available as arXiv preprint) | N/A | Paper |
Proof of the High Girth Existence Conjecture via Refined Absorption
(available as arXiv preprint) | N/A | Paper |
Refined Absorption: A New Proof of the Existence Conjecture
(available as arXiv preprint) | N/A | Paper |
Reducing Linear Hadwiger's Conjecture to Coloring Small Graphs
(available as arXiv preprint) | N/A | Paper |
