Attila Joó

Office hours:
By Appointment.

Teaching

• Lecture: Polyhedral combinatorics.

Publications

• On a linking property of infinite matroids, submitted (arXiv).
• Intersection of a partitional and a general infinite matroid, submitted (arXiv).
• (with Joshua Erde and Pascal Gollin) Enlarging vertex-flames in countable digraphs, submitted (arXiv).
• Proof of Nash-Williams' Intersection Conjecture for countable matroids, submitted (arXiv).
• (with Joshua Erde, Pascal Gollin, Paul Knappe and Max Pitz) Base partition for mixed families of finitary and cofinitary matroids, to appear in Combinatorica (arXiv, Journal).
• (with Joshua Erde, Pascal Gollin, Paul Knappe and Max Pitz) A Cantor-Bernstein-type theorem for spanning trees in infinite graphs, submitted (arXiv).
• (with Paul Ellis and Dániel T. Soukup) Reducing the dichromatic number via cycle reversions in infinite digraphs, European Journal of Combinatorics, Volume 90, Page: 103196, 2020, (open access).
• Uncountable dichromatic number without short directed cycles, Journal of Graph Theory, Volume 94, Issue 1, Pages 113-116, 2020, (open access).
• On the growth rate of dichromatic numbers of finite subdigraphs, Discrete Mathematics, Volume 343, Issue 3, 2019, (open access).
• Vertex-flames in countable rooted digraphs preserving an Erdős-Menger separation for each vertex, Combinatorica, Volume 39, Pages 1317-1333, 2019, (arXiv, Journal).
• On partitioning the edges of an infinite digraph into directed cycles, to appear in Advances in Combinatorics (arXiv).
• Countable Menger's Theorem with Finitary Matroid Constraints on the Ingoing Edges, Electronic Journal of Combinatorics, Volume 25, Issue 3, 2018, (open access).
• Gomory-Hu trees of infinite graphs with finite total weight, Journal of Graph Theory, Volume 95, Number 1, Pages 222-231, 2018, (arXiv, Journal).
• King-serf duo by monochromatic paths in k-edge-coloured tournaments (with Kristóf Bérczi) , 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 root-sets in infinite digraphs, Journal of Graph Theory, Volume 87, Number 1, Pages 96-107, 2017, (Journal).
• 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).
• Edmonds' branching theorem in digraphs without forward-infinite paths, Journal of Graph Theory, Volume 83, Number 3, Pages 303-311, 2016, (arXiv, Journal).