Fachbereich Mathematik 
  UHH > Faculties > MIN-Faculty > Mathematics > Staff > Attila Joó   STiNE |  KUS-Portal |  Sitemap Search Help es gibt keine deutsche Version dieser Seite  

Attila Joó

Department of Mathematics
Research Group DM
Bundesstraße 55 (Geomatikum)
20146 Hamburg
Room 236
phone: +49 40 42838-5133
email: attila.joo (at) uni-hamburg.de

Office hours:
By Appointment.


Teaching

WS 2018/19:


Publications

  • Uncountable dichromatic number without short directed cycles, 2019, (arXiv).
  • The Complete Lattice of Erdős-Menger Separations, 2019 (arXiv).
  • Vertex-flames in countable rooted digraphs preserving an Erdős-Menger separation for each vertex, to appear in Combinatorica (arXiv).
  • On partitioning the edges of an infinite digraph into dicycles, 2017 (arXiv).
  • Countable Menger's Theorem with Finitary Matroid Constraints on the Ingoing Edges, Electronic Journal of Combinatorics, Volume 25, Issue 3, 2018, (Journal).
  • T -Joins in Infinite Graphs, Electronic Journal of Combinatorics, Volume 24, Issue 3, 2018, (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, (Journal).
  • Gomory-Hu trees of infinite graphs with finite total weight, Journal of Graph Theory, Volume 95, Number 1, Pages 222-231, 2018, (arXiv, Journal).
  • 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).

 
  Seitenanfang  Impress 2019-05-27, Attila Joó