
Dr. Max Pitz
Fachbereich Mathematik
Bereich DM
Bundesstraße 55 (Geomatikum)
20146 Hamburg

Raum 238
Tel.: +49 40 428387658
EMail:
max.pitz (at) unihamburg.de


Sprechstunden:
Direkt nach der Vorlesung oder nach Absprache per Email.
Teaching
SoSe 2020:
Vergangene Lehre.
Publications and Preprints
 A unified existence theorem for normal spanning trees, J. Combin. Theory (Series B), 145 (2020), 466469. (Journal/ArXiv).
 (with J. Erde, P. Gollin, A. Joo, P. Knappe) Base partition for finitarycofinatary matroid families, to appear in Combinatorica. (ArXiv).
 (with C. Bürger) Partitioning edgecoloured infinite complete bipartite graphs into monochromatic paths, published online in Israel J. Math on 5 June 2020. (Journal/ArXiv).
 (with B. Espinoza and P. Gartside) Graphlike compacta: characterizations and Eulerian loops, J. Graph Theory, published electronically on 6 March 2020. (Journal/ArXiv).
 (with P. Knappe) Circuits through prescribed edges, J. Graph Theory, 93(4) (2020) 470482. (Journal/ArXiv).
 (with J. Erde and F. Lehner) Hamilton decompositions of oneended Cayley graphs, J. Combin. Theory (Series B), 140 (2020) 171191. (Journal/ArXiv).
 (with J. Kurkofka) Tangles and the StoneCech compactification of infinite graphs, J. Combin. Theory (Series B) 146 (2021), 3460. (Journal/ArXiv).
 (with J. Kurkofka) Ends, tangles and critical vertex sets, Math. Nachrichten 292(9) (2019) 20722091. (Journal/ArXiv).
 (with P. Gartside) Narc and ncircle connected graphlike spaces, Topology Appl. 256 (2019) 725. (Journal/ArXiv).
 (with C. Bürger, L. DeBiasio and H. Guggiari) Partitioning edgecoloured complete symmetric digraphs into monochromatic complete subgraphs, Discrete Math. 341(11) (2018), 31343140. (Journal/ArXiv).
 Hamilton cycles in infinite cubic graphs, Electron. J. Comb. 25(3) (2018), #P3.3. (Journal/ArXiv).
 (with N. Bowler and S. Geschke) Minimal obstructions for normal spanning trees, Fund. Math. 241 (2018), 245263. (Journal/ArXiv).
 (with N. Bowler, J. Erde, P. Heinig and F. Lehner) Nonreconstructible locally finite graphs, J. Combin. Theory (Series B) 133 (2018), 122152. (Journal/ArXiv).
 (with N. Bowler, J. Erde, P. Heinig and F. Lehner) A counterexample to the reconstruction conjecture for locally finite trees, Bull. London Math. Soc. 49 (2017), 630648. (Journal/ArXiv).
 (with N. Bowler, J. Erde, F. Lehner, M. Merker and K. Stavropoulos) A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs, Discrete Appl. Math. 229 (2017), 151153. (Journal/ArXiv).
 (with P. Gartside and R. Suabedissen) Reconstructing compact metrizable spaces, Proc. Amer. Math. Soc. 145 (2017), 429443. (Journal/ArXiv).
 (with P. Gartside and R. Suabedissen) Reconstructing topological graphs and continua, Colloquium Math. 148 (2017), 107122. (Journal/ArXiv).
 (with R. Suabedissen) A topological variation of the reconstruction conjecture, Glasg. Math. J. 59 (2017), 221235. (Journal/ArXiv).
 (with R. Lupton) Selfmaps under the compactopen topology, Topology Appl. 212 (2016) 122141. (Journal/ArXiv).
 (with R. Suabedissen) Compactifications of ω*\{x} and S_{κ}\{x}, Topology Proc. 45 (2015) 151173. (Journal/ArXiv).
 Quickly proving Diestel's normal spanning tree criterion, submitted. (ArXiv).
 A note on minor antichains of uncountable graphs, submitted. (ArXiv).
 Proof of Halin's normal spanning tree conjecture, submitted. (ArXiv).
 A new obstruction for normal spanning trees, submitted. (ArXiv).
 (with J. Kurkofka and R. Melcher) Approximating infinite graphs by normal trees, submitted. (ArXiv).
 (with N. Bowler, J. Erde and F. Lehner) Bounding the cop number of a graph by its genus, submitted. (ArXiv).
 (with J. Erde, P. Gollin, A. Joo, P. Knappe) A CantorBernsteintype theorem for spanning trees in infinite graphs, submitted. (ArXiv).
 (with P. Gartside) Eulerian spaces, submitted. (ArXiv).
 (with N. Bowler, C. Elbracht, J. Erde, P. Gollin, K. Heuer and M. Teegen) Ubiquity in graphs II: Ubiquity of graphs with nonlinear end structure, submitted. (ArXiv).
 (with N. Bowler, C. Elbracht, J. Erde, P. Gollin, K. Heuer and M. Teegen) Ubiquity in graphs I: Topological ubiquity of trees, submitted. (ArXiv).
 (with P. Gartside and A. Mamatelashvili) Narc connected graphs, submitted. (ArXiv).
 (with C. Bürger) Decomposing edgecoloured complete symmetric digraphs into monochromatic paths, manuscript. (ArXiv).
Selected talks
 Applications of order trees in infinite graphs, Invited plenary talk, ALGOS2020, Nancy, France, August 2020.
 Infinite Eulerian graphs and strongly irreducible images of intervals, Invited talk for the special session on Topology and Graph Theory, Spring Topology and Dynamical Systems Conference, Birmingham AL, March 2019.
 Recent developments in reconstruction of infinite graphs, International Conference on Graph Theory, Lyon, France, July 2018.
 Updates on the ubiquity conjecture, BerlinPoznańHamburg Seminar, Berlin, Germany, June 2018.

