| Publication | Date of Publication | Type |
|---|
Monochromatic partitions in 2-edge-coloured bipartite graphs
The Electronic Journal of Combinatorics | 2026-02-04 | Paper |
Embedding nearly spanning trees
Combinatorics, Probability and Computing | 2025-12-30 | Paper |
On the Ramsey number of the double star
Discrete Mathematics | 2024-11-09 | Paper |
Antidirected subgraphs of oriented graphs
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
Embedding trees with maximum and minimum degree conditions
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles
European Journal of Combinatorics | 2024-09-30 | Paper |
Kalai's conjecture in \(r\)-partite \(r\)-graphs
European Journal of Combinatorics | 2024-01-23 | Paper |
Dirac-type conditions for spanning bounded-degree hypertrees
Journal of Combinatorial Theory. Series B | 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 II: A tight result
Journal of Graph Theory | 2023-10-09 | Paper |
Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result
Journal of Graph Theory | 2023-10-09 | Paper |
Antipaths in oriented graphs
Discrete Mathematics | 2023-06-12 | Paper |
Monochromatic paths in 2-edge-coloured graphs and hypergraphs
The Electronic Journal of Combinatorics | 2023-04-19 | Paper |
3-colouring \(P_t\)-free graphs without short odd cycles
Algorithmica | 2023-04-11 | Paper |
On the Erdős–Sós conjecture for trees with bounded degree
Combinatorics, Probability and Computing | 2023-03-30 | Paper |
Clique immersions and independence number
European Journal of Combinatorics | 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
(available as arXiv preprint) | 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
(available as arXiv preprint) | 2021-10-04 | Paper |
Better 3-coloring algorithms: excluding a triangle and a seven vertex path
Theoretical Computer Science | 2020-12-16 | Paper |
Maximum and minimum degree conditions for embedding trees
SIAM Journal on Discrete Mathematics | 2020-10-27 | Paper |
$3$-Colouring $P_t$-free graphs without short odd cycles
(available as arXiv preprint) | 2020-08-11 | Paper |
A variant of the Erdős-Sós conjecture
Journal of Graph Theory | 2020-05-21 | Paper |
Degree conditions for embedding trees
SIAM Journal on Discrete Mathematics | 2019-09-02 | Paper |
Approximately coloring graphs without long induced paths
Algorithmica | 2019-06-27 | Paper |
On the Erd\H{o}s-S\'os conjecture for trees with bounded degree
(available as arXiv preprint) | 2019-06-24 | Paper |
Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles
Journal of Graph Theory | 2019-06-14 | Paper |
Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
Journal of Graph Theory | 2019-06-14 | Paper |
Three-coloring and list three-coloring of graphs without induced paths on seven vertices
Combinatorica | 2018-09-24 | Paper |
Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles
European Journal of Combinatorics | 2018-05-18 | Paper |
The domino problem on groups of polynomial growth
Groups, Geometry, and Dynamics | 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
Lecture Notes in Computer Science | 2018-01-04 | Paper |
Monochromatic tree covers and Ramsey numbers for set-coloured graphs
Discrete Mathematics | 2017-10-24 | Paper |
Almost partitioning a 3-edge-colored \(K_{n,n}\) into five monochromatic cycles
SIAM Journal on Discrete Mathematics | 2017-06-23 | Paper |
The approximate Loebl-Komlós-Sós conjecture. I: The sparse decomposition
SIAM Journal on Discrete Mathematics | 2017-06-14 | Paper |
The approximate Loebl-Komlós-Sós conjecture. I: The sparse decomposition
SIAM Journal on Discrete Mathematics | 2017-06-14 | Paper |
The approximate Loebl-Komlós-Sós conjecture II: The rough structure of LKS graphs
SIAM Journal on Discrete Mathematics | 2017-06-14 | Paper |
The approximate Loebl-Komlós-Sós conjecture II: The rough structure of LKS graphs
SIAM Journal on Discrete Mathematics | 2017-06-14 | Paper |
The approximate Loebl-Komlós-Sós conjecture III: The finer structure of LKS graphs
SIAM Journal on Discrete Mathematics | 2017-06-14 | Paper |
The approximate Loebl-Komlós-Sós conjecture III: The finer structure of LKS graphs
SIAM Journal on Discrete Mathematics | 2017-06-14 | Paper |
The approximate Loebl-Komlós-Sós conjecture IV: Embedding techniques and the proof of the main result
SIAM Journal on Discrete Mathematics | 2017-06-14 | Paper |
The approximate Loebl-Komlós-Sós conjecture IV: Embedding techniques and the proof of the main result
SIAM Journal on Discrete Mathematics | 2017-06-14 | Paper |
Clique coloring \(B_1\)-EPG graphs
Discrete Mathematics | 2017-02-27 | Paper |
Local colourings and monochromatic partitions in complete bipartite graphs
European Journal of Combinatorics | 2016-11-07 | Paper |
Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
Electronic Notes in Discrete Mathematics | 2016-10-17 | Paper |
Local colourings and monochromatic partitions in complete bipartite graphs
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
| Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles | 2016-10-14 | Paper |
List edge-coloring and total coloring in graphs of low treewidth
Journal of Graph Theory | 2016-04-15 | Paper |
The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
Electronic Research Announcements in Mathematical Sciences | 2016-03-09 | Paper |
Monochromatic cycle partitions in local edge colorings
Journal of Graph Theory | 2016-02-01 | Paper |
Monochromatic cycle partitions in local edge colorings
Journal of Graph Theory | 2016-02-01 | Paper |
Convex \(p\)-partitions of bipartite graphs
Theoretical Computer Science | 2015-12-08 | Paper |
\(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs
Algorithmica | 2015-10-19 | Paper |
\(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Geodesic stability for memoryless binary long-lived consensus
Journal of Computer and System Sciences | 2015-07-13 | Paper |
Linear and projective boundaries in HNN-extensions and distortion phenomena
Journal of Group Theory | 2015-05-11 | Paper |
Complexity of splits reconstruction for low-degree trees
Discrete Applied Mathematics | 2014-11-28 | Paper |
Connectivity and tree structure in finite graphs
Combinatorica | 2014-08-14 | Paper |
Connectivity and tree structure in finite graphs
Combinatorica | 2014-08-14 | Paper |
Cycles Are Strongly Ramsey-Unsaturated
Combinatorics, Probability and Computing | 2014-08-06 | Paper |
Minimal bricks have many vertices of small degree
European Journal of Combinatorics | 2014-03-25 | Paper |
Characterising claw-free \(t\)-perfect graphs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Forcing large complete (topological) minors in infinite graphs
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
Forcing large complete (topological) minors in infinite graphs
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
The relative degree and large complete minors in infinite graphs
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Stability in geodesics for memoryless binary long-lived consensus
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
| The approximate Loebl-Koml\'os-S\'os Conjecture | 2012-11-13 | Paper |
On claw-free \(t\)-perfect graphs
Mathematical Programming. Series A. Series B | 2012-06-26 | Paper |
An approximate version of the Loebl-Komlós-Sós conjecture
Journal of Combinatorial Theory. Series B | 2012-03-19 | Paper |
Complexity of splits reconstruction for low-degree trees
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
Extremal infinite graph theory
Discrete Mathematics | 2011-08-08 | Paper |
Ends and vertices of small degree in infinite minimally \(k\)-(Edge)-connected graphs
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
\(t\)-perfection is always strong for claw-free graphs
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
Duality of ends
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
An approximate version of the Loebl-Komlós-Sós conjecture
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
On end degrees and infinite cycles in locally finite graphs
Combinatorica | 2007-11-12 | Paper |
Forcing highly connected subgraphs
Journal of Graph Theory | 2007-05-11 | Paper |
Arboricity and tree-packing in locally finite graphs
Journal of Combinatorial Theory. Series B | 2006-04-28 | Paper |
MacLane's planarity criterion for locally finite graphs
Journal of Combinatorial Theory. Series B | 2006-04-28 | Paper |
Menger's theorem for infinite graphs with ends
Journal of Graph Theory | 2005-12-08 | Paper |
Cycle‐cocycle partitions and faithful cycle covers for locally finite graphs
Journal of Graph Theory | 2005-11-07 | Paper |
Antidirected subgraphs of oriented graphs
(available as arXiv preprint) | N/A | Paper |
On the Ramsey number of the double star
(available as arXiv preprint) | N/A | Paper |
An exact upper bound for the minimum size of a path system that weakly separates a clique
(available as arXiv preprint) | N/A | Paper |
Monochromatic partitions in 2-edge-coloured bipartite graphs
(available as arXiv preprint) | N/A | Paper |
