Attila Joó

Sprechstunden:
jederzeit nach Vereinbarung per Email

Lehre

Publications

Submitted

• (with Zsuzsanna Jankó) On generalisations of the Aharoni-Pouzet base exchange theorem (arXiv).
• (with Nathan Bowler, Florian Gut and Max Pitz) Maker-Breaker games on K_ω1 and K_ω,ω1 (arXiv)
• (with Raphael W. Jacobs, Paul Knappe, Jan Kurkofka, Ruben Melcher) The Lovász-Cherkassky theorem for locally finite graphs with ends (arXiv).
• On the Packing/Covering Conjecture of infinite matroids (arXiv).
• The Lovász-Cherkassky theorem in countable graphs (arXiv).

Published or to appear

1. A Cantor-Bernstein theorem for infinite matroids, to appear in Journal of Combinatorics (arXiv).
2. (with Florian Gut) Large vertex-flames in uncountable digraphs, to appear in Israel Journal of Mathematics (arXiv).
3. (with Zsuzsanna Jankó) Cutting a cake for infinitely many guests, Electronic Journal of Combinatorics, Volume 29, Issue 1, 2022, (open access).
4. Greedoids from flames, Journal of graph theory, Volume 98, Issue 1, 2021, Pages 49-56, 2021 (arXiv, Journal).
5. Intersection of a partitional and a general infinite matroid, Discrete Mathematics, Volume 344, Issue 9, 2021, 112514 (open access).
6. (with Joshua Erde and Pascal Gollin) Enlarging vertex-flames in countable digraphs, Journal of Combinatorial Theory, Series B , Volume 151, November 2021, Pages 263-281 (open access).
7. Proof of Nash-Williams' Intersection Conjecture for countable matroids, Advances in Mathematics, Volume 380, Pages 107608, 2021, (open access).
8. On partitioning the edges of an infinite digraph into directed cycles, 2021 Advances in Combinatorics (open access).
9. (with Joshua Erde, Pascal Gollin, Paul Knappe and Max Pitz) Base partition for mixed families of finitary and cofinitary matroids, Combinatorica, Volume 41, Number 1, Pages 31-52, 2021, (arXiv, Journal).
10. (with Joshua Erde, Pascal Gollin, Paul Knappe and Max Pitz) A Cantor-Bernstein-type theorem for spanning trees in infinite graphs, Journal of Combinatorial Theory, Series B, Volume 149, Pages 16-22, 2021, (open access).
11. (with Paul Ellis and Dániel T. Soukup) Reducing the dichromatic number via cycle reversions in infinite digraphs, European Journal of Combinatorics, Volume 90, Pages 103196, 2020, (open access).
12. Uncountable dichromatic number without short directed cycles, Journal of Graph Theory, Volume 94, Issue 1, Pages 113-116, 2020, (open access).
13. On the growth rate of dichromatic numbers of finite subdigraphs, Discrete Mathematics, Volume 343, Issue 3, 111735, 2020, (open access).
14. Vertex-flames in countable rooted digraphs preserving an Erdős-Menger separation for each vertex, Combinatorica, Volume 39, Pages 1317-1333, 2019, (arXiv, Journal).
15. Countable Menger's theorem with finitary matroid constraints on the ingoing edges, Electronic Journal of Combinatorics, Volume 25, Issue 3, 2018, (open access).
16. Gomory-Hu trees of infinite graphs with finite total weight, Journal of Graph Theory, Volume 95, Number 1, Pages 222-231, 2018, (arXiv, Journal).
17. (with Kristóf Bérczi) King-serf duo by monochromatic paths in k-edge-coloured tournaments, Electronic Journal of Combinatorics, Volume 24, Issue 1, 2017, (open access).
18. T -Joins in infinite graphs, Electronic Journal of Combinatorics, Volume 24, Issue 3, 2017, (open access).
19. Packing countably many branchings with prescribed root-sets in infinite digraphs, Journal of Graph Theory, Volume 87, Number 1, Pages 96-107, 2017, (Journal).
20. Highly connected infinite digraphs without edge-disjoint back and forth paths between a certain vertex pair, Journal of Graph Theory, Volume 85, Number 1, Pages 51-55, 2017, (arXiv, Journal).
21. Edmonds' branching theorem in digraphs without forward-infinite paths, Journal of Graph Theory, Volume 83, Number 3, Pages 303-311, 2016, (arXiv, Journal).