| Publication | Date of Publication | Type |
|---|
| Kalai's conjecture in \(r\)-partite \(r\)-graphs | 2024-01-23 | Paper |
| Dirac-type conditions for spanning bounded-degree hypertrees | 2024-01-15 | Paper |
| Oriented trees and paths in digraphs | 2023-10-28 | Paper |
| Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result | 2023-10-09 | Paper |
| Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result | 2023-10-09 | Paper |
| Antipaths in oriented graphs | 2023-06-12 | Paper |
| Monochromatic paths in 2-edge-coloured graphs and hypergraphs | 2023-04-19 | Paper |
| 3-colouring \(P_t\)-free graphs without short odd cycles | 2023-04-11 | Paper |
| On the Erdős–Sós conjecture for trees with bounded degree | 2023-03-30 | Paper |
| Clique immersions and independence number | 2022-09-14 | Paper |
| Large immersions in graphs with independence number 3 and 4 | 2022-04-27 | Paper |
| Monochromatic paths in $2$-edge coloured graphs and hypergraphs | 2022-04-26 | Paper |
| Partitioning a 2-edge-coloured graph of minimum degree $2n/3 + o(n)$ into three monochromatic cycles | 2022-04-01 | Paper |
| Active clustering for labeling training data | 2021-10-27 | Paper |
| Towards a hypergraph version of the P\'osa-Seymour conjecture | 2021-10-18 | Paper |
| Tree containment and degree conditions | 2021-10-04 | Paper |
| Better 3-coloring algorithms: excluding a triangle and a seven vertex path | 2020-12-16 | Paper |
| Maximum and Minimum Degree Conditions for Embedding Trees | 2020-10-27 | Paper |
| $3$-Colouring $P_t$-free graphs without short odd cycles | 2020-08-11 | Paper |
| A variant of the Erdős‐Sós conjecture | 2020-05-21 | Paper |
| Degree Conditions for Embedding Trees | 2019-09-02 | Paper |
| Approximately coloring graphs without long induced paths | 2019-06-27 | Paper |
| On the Erd\H{o}s-S\'os conjecture for trees with bounded degree | 2019-06-24 | Paper |
| Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles | 2019-06-14 | Paper |
| Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles | 2019-06-14 | Paper |
| Three-coloring and list three-coloring of graphs without induced paths on seven vertices | 2018-09-24 | Paper |
| Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles | 2018-05-18 | Paper |
| The domino problem on groups of polynomial growth | 2018-04-27 | Paper |
| Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles | 2018-01-18 | Paper |
| Approximately coloring graphs without long induced paths | 2018-01-04 | Paper |
| Monochromatic tree covers and Ramsey numbers for set-coloured graphs | 2017-10-24 | Paper |
| Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles | 2017-06-23 | Paper |
| The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition | 2017-06-14 | Paper |
| The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs | 2017-06-14 | Paper |
| The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs | 2017-06-14 | Paper |
| The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result | 2017-06-14 | Paper |
| Clique coloring \(B_1\)-EPG graphs | 2017-02-27 | Paper |
| Local colourings and monochromatic partitions in complete bipartite graphs | 2016-11-07 | Paper |
| Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles | 2016-10-17 | Paper |
| Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles | 2016-10-14 | Paper |
| Local colourings and monochromatic partitions in complete bipartite graphs | 2016-10-14 | Paper |
| List Edge-Coloring and Total Coloring in Graphs of Low Treewidth | 2016-04-15 | Paper |
| The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs | 2016-03-09 | Paper |
| Monochromatic Cycle Partitions in Local Edge Colorings | 2016-02-01 | Paper |
| Convex \(p\)-partitions of bipartite graphs | 2015-12-08 | Paper |
| \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs | 2015-10-19 | Paper |
| \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs | 2015-10-16 | Paper |
| Geodesic stability for memoryless binary long-lived consensus | 2015-07-13 | Paper |
| Linear and projective boundaries in HNN-extensions and distortion phenomena | 2015-05-11 | Paper |
| Complexity of splits reconstruction for low-degree trees | 2014-11-28 | Paper |
| Connectivity and tree structure in finite graphs | 2014-08-14 | Paper |
| Cycles Are Strongly Ramsey-Unsaturated | 2014-08-06 | Paper |
| Minimal bricks have many vertices of small degree | 2014-03-25 | Paper |
| Characterising claw-free t-perfect graphs | 2013-10-10 | Paper |
| Forcing Large Complete (Topological) Minors in Infinite Graphs | 2013-09-26 | Paper |
| The relative degree and large complete minors in infinite graphs | 2013-07-23 | Paper |
| Stability in geodesics for memoryless binary long-lived consensus | 2013-07-23 | Paper |
| The approximate Loebl-Koml\'os-S\'os Conjecture | 2012-11-13 | Paper |
| On claw-free \(t\)-perfect graphs | 2012-06-26 | Paper |
| An approximate version of the Loebl-Komlós-Sós conjecture | 2012-03-19 | Paper |
| Complexity of Splits Reconstruction for Low-Degree Trees | 2011-12-16 | Paper |
| Extremal infinite graph theory | 2011-08-08 | Paper |
| Ends and Vertices of Small Degree in Infinite Minimally k-(Edge)-Connected Graphs | 2011-07-18 | Paper |
| t-Perfection Is Always Strong for Claw-Free Graphs | 2011-06-17 | Paper |
| Duality of Ends | 2010-04-23 | Paper |
| The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars | 2009-04-07 | Paper |
| An approximate version of the Loebl-Komlós-Sós conjecture | 2008-06-05 | Paper |
| On end degrees and infinite cycles in locally finite graphs | 2007-11-12 | Paper |
| Forcing highly connected subgraphs | 2007-05-11 | Paper |
| MacLane's planarity criterion for locally finite graphs | 2006-04-28 | Paper |
| Arboricity and tree-packing in locally finite graphs | 2006-04-28 | Paper |
| Menger's theorem for infinite graphs with ends | 2005-12-08 | Paper |
| Cycle‐cocycle partitions and faithful cycle covers for locally finite graphs | 2005-11-07 | Paper |
| Antidirected subgraphs of oriented graphs | 0001-01-03 | Paper |
| On the Ramsey number of the double star | 0001-01-03 | Paper |
| An exact upper bound for the minimum size of a path system that weakly separates a clique | 0001-01-03 | Paper |
| Monochromatic partitions in 2-edge-coloured bipartite graphs | 0001-01-03 | Paper |
