Attila Joó
Sprechstunden:
jederzeit nach Vereinbarung per Email
Lehre
WiSe 2018/2019: Polyhedral Combinatorics
WiSe 2020/2021: Lineare Algebra und analytische Geometrie I
SoSe 2021: Lineare Algebra und analytische Geometrie II
WiSe 2021/2022: Mathematik für Informatiker I
SoSe 2022: Infinite graph theory II
WiSe 2022/2023: Graphentheorie II und Mathematik für Physiker I
Publications
Submitted
 (with Raphael W. Jacobs, Paul Knappe, Jan Kurkofka, Ruben Melcher) The LovászCherkassky theorem for locally finite graphs with ends, (arXiv).
Published or to appear
 (with Zsuzsanna Jankó) On generalisations of the AharoniPouzet base exchange theorem, to appear in Bulletin of the London Mathematical Society (arXiv).
 (with J. Pascal Gollin) Matching variables to equations in infinite linear equation systems, to appear in Linear Algebra and Its Applications, (arXiv).
 The LovászCherkassky theorem in countable graphs, to appear in Journal of Combinatorial Theory, Series B , (arXiv).
 On the Packing/Covering Conjecture of infinite matroids, to appear in Israel Journal of Mathematics, (arXiv).
 (with Nathan Bowler, Florian Gut and Max Pitz) MakerBreaker games on K_{ω1} and K_{ω,ω1}, to appear in Journal of Symbolic Logic, (arXiv)
 A CantorBernstein theorem for infinite matroids, to appear in Journal of Combinatorics, (arXiv).
 (with Florian Gut) Large vertexflames in uncountable digraphs, to appear in Israel Journal of Mathematics, (arXiv).
 (with Zsuzsanna Jankó) Cutting a cake for infinitely many guests, Electronic Journal of Combinatorics, Volume 29, Issue 1, P1.42, 2022, (open access).
 Greedoids from flames, Journal of Graph Theory, Volume 98, Issue 1, 2021, Pages 4956, 2021, (arXiv, Journal).
 Intersection of a partitional and a general infinite matroid, Discrete Mathematics, Volume 344, Issue 9, 112514, 2021, (open access).
 (with Joshua Erde and Pascal Gollin) Enlarging vertexflames in countable digraphs, Journal of Combinatorial Theory, Series B , Volume 151, Pages 263281, 2021, (open access).
 Proof of NashWilliams' Intersection Conjecture for countable matroids, Advances in Mathematics, Volume 380, Pages 107608, 2021, (open access).
 On partitioning the edges of an infinite digraph into directed cycles, Advances in Combinatorics , 2021, (open access).
 (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 3152, 2021, (arXiv, Journal).
 (with Joshua Erde, Pascal Gollin, Paul Knappe and Max Pitz) A CantorBernsteintype theorem for spanning trees in infinite graphs, Journal of Combinatorial Theory, Series B, Volume 149, Pages 1622, 2021, (open access).
 (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).
 Uncountable dichromatic number without short directed cycles, Journal of Graph Theory, Volume 94, Issue 1, Pages 113116, 2020, (open access).
 On the growth rate of dichromatic numbers of finite subdigraphs, Discrete Mathematics, Volume 343, Issue 3, 111735, 2020, (open access).
 Vertexflames in countable rooted digraphs preserving an ErdősMenger separation for each vertex, Combinatorica, Volume 39, Pages 13171333, 2019, (arXiv, Journal).
 Countable Menger's theorem with finitary matroid constraints on the ingoing edges, Electronic Journal of Combinatorics, Volume 25, Issue 3, 2018, (open access).
 GomoryHu trees of infinite graphs with finite total weight, Journal of Graph Theory, Volume 95, Number 1, Pages 222231, 2018,
(arXiv, Journal).
 (with Kristóf Bérczi) Kingserf duo by monochromatic paths in kedgecoloured tournaments, Electronic Journal of Combinatorics, Volume 24, Issue 1, 2017, (open access).
 T Joins in infinite graphs, Electronic Journal of Combinatorics, Volume 24, Issue 3, 2017, (open access).
 Packing countably many branchings with prescribed rootsets in infinite digraphs, Journal of Graph Theory, Volume 87, Number 1, Pages 96107, 2017,
(Journal).
 Highly connected infinite digraphs without edgedisjoint back and forth paths between a certain vertex
pair, Journal of Graph Theory, Volume 85, Number 1, Pages 5155, 2017, (arXiv, Journal).
 Edmonds' branching theorem in digraphs without forwardinfinite
paths, Journal of Graph Theory, Volume 83, Number 3, Pages 303311, 2016, (arXiv, Journal).
