| Publication | Date of Publication | Type |
|---|
On Connected Strongly-Proportional Cake-Cutting
(available as arXiv preprint) | N/A | Paper |
A Note on Matching Variables to Equations
(available as arXiv preprint) | N/A | Paper |
Fairer than fair: sharp bounds for connected super-proportional cake cutting
The Journal of Artificial Intelligence Research (JAIR) | 2026-07-30 | Paper |
Circuit-partition of infinite matroids
Journal of Combinatorial Theory. Series B | 2026-06-16 | Paper |
Well-order a flame
(available as arXiv preprint) | 2026-01-01 | Paper |
Global and local degree conditions for matchability
(available as arXiv preprint) | 2026-01-01 | Paper |
Hindrance from a wasteful partial linkage
The Electronic Journal of Combinatorics | 2025-09-25 | Paper |
A note on matching variables to equations
Innovations in Graph Theory | 2025-03-05 | Paper |
The Lovász-Cherkassky theorem in infinite graphs
Transactions of the London Mathematical Society | 2025-01-08 | Paper |
Hindrance from a wasteful common independent set
(available as arXiv preprint) | 2025-01-01 | Paper |
Wild generalised truncation of infinite matroids
(available as arXiv preprint) | 2025-01-01 | Paper |
A structure theorem for rooted connectivity in bidirected graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
Large flames in rooted acyclic digraphs without backward-infinite paths
(available as arXiv preprint) | 2025-01-01 | Paper |
On the packing/covering conjecture of infinite matroids
Israel Journal of Mathematics | 2024-08-28 | Paper |
Finite matchability under the matroidal Hall's condition
Journal of Combinatorial Theory. Series B | 2024-05-10 | Paper |
Large vertex-flames in uncountable digraphs
Israel Journal of Mathematics | 2024-04-16 | Paper |
Circuit-partition of infinite matroids
(available as arXiv preprint) | 2024-01-01 | Paper |
Hindrance from a wasteful partial linkage
(available as arXiv preprint) | 2024-01-01 | Paper |
| The Lov\'asz-Cherkassky theorem in infinite graphs | 2023-11-11 | Paper |
Greedoids from flames
Journal of Graph Theory | 2023-10-04 | Paper |
The Lovász-Cherkassky theorem for locally finite graphs with ends
Discrete Mathematics | 2023-10-04 | Paper |
On generalisations of the Aharoni–Pouzet base exchange theorem
Bulletin of the London Mathematical Society | 2023-09-15 | Paper |
MAKER–BREAKER GAMES ON AND
Journal of Symbolic Logic | 2023-06-05 | Paper |
| Weakly reflecting graph properties | 2023-05-30 | Paper |
A Cantor-Bernstein theorem for infinite matroids
Journal of Combinatorics | 2023-01-11 | Paper |
The Lovász-Cherkassky theorem in countable graphs
Journal of Combinatorial Theory. Series B | 2023-01-04 | Paper |
Matching variables to equations in infinite linear equation systems
Linear Algebra and its Applications | 2023-01-04 | Paper |
Weakly reflecting graph properties
(available as arXiv preprint) | 2023-01-01 | Paper |
Cutting a cake for infinitely many guests
The Electronic Journal of Combinatorics | 2022-04-04 | Paper |
On partitioning the edges of an infinite digraph into directed cycles
Advances in Combinatorics | 2021-11-05 | Paper |
Enlarging vertex-flames in countable digraphs
Journal of Combinatorial Theory. Series B | 2021-09-16 | Paper |
Intersection of a partitional and a general infinite matroid
Discrete Mathematics | 2021-07-08 | Paper |
Base partition for mixed families of finitary and cofinitary matroids
Combinatorica | 2021-06-29 | Paper |
| On the Packing/Covering Conjecture of Infinite Matroids | 2021-03-27 | Paper |
Proof of Nash-Williams' intersection conjecture for countable matroids
Advances in Mathematics | 2021-02-15 | Paper |
Reducing the dichromatic number via cycle reversions in infinite digraphs
European Journal of Combinatorics | 2021-02-08 | Paper |
Uncountable dichromatic number without short directed cycles
Journal of Graph Theory | 2020-05-21 | Paper |
Vertex-flames in countable rooted digraphs preserving an Erdős-Menger separation for each vertex
Combinatorica | 2020-02-26 | Paper |
On the growth rate of dichromatic numbers of finite subdigraphs
Discrete Mathematics | 2020-01-22 | Paper |
| The Complete Lattice of Erd\H{o}s-Menger Separations | 2019-04-12 | Paper |
The Complete Lattice of Erdős-Menger Separations
(available as arXiv preprint) | 2019-01-01 | Paper |
Countable Menger's theorem with finitary matroid constraints on the ingoing edges
The Electronic Journal of Combinatorics | 2018-08-15 | Paper |
Countable Menger's theorem with finitary matroid constraints on the ingoing edges
The Electronic Journal of Combinatorics | 2018-08-15 | Paper |
Gomory‐Hu trees of infinite graphs with finite total weight
Journal of Graph Theory | 2018-07-13 | Paper |
Packing countably many branchings with prescribed root-sets in infinite digraphs
Journal of Graph Theory | 2018-02-23 | Paper |
\(T\)-joins in infinite graphs
The Electronic Journal of Combinatorics | 2017-07-26 | Paper |
Highly connected infinite digraphs without edge-disjoint back and forth paths between a certain vertex pair
Journal of Graph Theory | 2017-06-30 | Paper |
| Independent and maximal branching packing in infinite matroid-rooted digraphs | 2017-05-02 | Paper |
| T-joins in infinite graphs as edge-disjoint system of paths matching the vertices in T | 2017-04-24 | Paper |
King-serf duo by monochromatic paths in \(k\)-edge-coloured tournaments
The Electronic Journal of Combinatorics | 2017-04-10 | Paper |
King-serf duo by monochromatic paths in \(k\)-edge-coloured tournaments
The Electronic Journal of Combinatorics | 2017-04-10 | Paper |
T-joins in infinite graphs as edge-disjoint system of paths matching the vertices in $ T $
(available as arXiv preprint) | 2017-01-01 | Paper |
Independent and maximal branching packing in infinite matroid-rooted digraphs
(available as arXiv preprint) | 2017-01-01 | Paper |
Edmonds' branching theorem in digraphs without forward-infinite paths
Journal of Graph Theory | 2016-11-16 | Paper |
