Get started
Author

Max F. Pitz

Observed names: M. Pitz, MAX F. PITZ, MAX PITZ, Max Pitz, Pitz, Max, Pitz, Max F., Pitz, Max. F.
ORCID: 0000-0001-8961-6132
Observed ORCID: 0000-0001-8961-6132
OpenAlex ID: A5020032467
Approximating infinite graphs by normal trees
2021 · Kurkofka, Jan, Melcher, Ruben, et al. · University of Birmingham Research Portal (University of Birmingham) · 14
Bounding the cop number of a graph by its genus
2021 · Bowler, Nathan, Erde, Joshua; id_orcid 0000-0003-1129-4270, et al. · University of Birmingham Research Portal (University of Birmingham) · 11
Proof of Halin’s normal spanning tree conjecture
2021 · Max Pitz · Israel Journal of Mathematics · 9
PDF
A new obstruction for normal spanning trees
2021 · Max Pitz · Bulletin of the London Mathematical Society · 9
Ends, tangles and critical vertex sets
2019 · Jan Kurkofka, Max Pitz · Mathematische Nachrichten · 9
PDF
Tangles and the Stone-Čech compactification of infinite graphs
2020 · Jan Kurkofka, Max Pitz · Journal of Combinatorial Theory Series B · 8
A counterexample to Montgomery’s conjecture on dynamic colourings of regular graphs
2017 · N. Bowler, J. Erde, et al. · Discrete Applied Mathematics · 8
PDF
Base Partition for Mixed Families of Finitary and Cofinitary Matroids
2021 · Erde, Joshua; id_orcid 0000-0003-1129-4270, Gollin, J. Pascal, et al. · University of Birmingham Research Portal (University of Birmingham) · 7
A unified existence theorem for normal spanning trees
2020 · Max Pitz · Journal of Combinatorial Theory Series B · 7
Minimal obstructions for normal spanning trees
2018 · Nathan Bowler, Stefan Geschke, et al. · Fundamenta Mathematicae · 7
PDF
Ubiquity of graphs with nowhere‐linear end structure
2023 · Nathan Bowler, Christian Elbracht, et al. · Journal of Graph Theory · 6
PDF
Topological ubiquity of trees
2022 · Nathan Bowler, Christian Elbracht, et al. · Journal of Combinatorial Theory Series B · 6
PDF
Hamilton decompositions of one-ended Cayley graphs
2020 · Erde, Joshua; id_orcid 0000-0003-1129-4270, Lehner, Florian, et al. · University of Birmingham Research Portal (University of Birmingham) · 5
A counterexample to the reconstruction conjecture for locally finite trees
2017 · Nathan Bowler, Joshua Erde, et al. · Bulletin of the London Mathematical Society · 5
A Topological Variation of the Reconstruction Conjecture
2016 · MAX F. PITZ, ROLF SUABEDISSEN · Glasgow Mathematical Journal · 5
Bounding the Cop Number of a Graph by Its Genus
2021 · Nathan Bowler, Joshua Erde, et al. · SIAM Journal on Discrete Mathematics · 4
PDF
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
2021 · Erde, Joshua; id_orcid 0000-0003-1129-4270, Pascal Gollin, J., et al. · University of Birmingham Research Portal (University of Birmingham) · 3
Halin’s End Degree Conjecture
2021 · Stefan Geschke, Jan Kurkofka, et al. · Trends in mathematics · 3
Graph‐like compacta: Characterizations and Eulerian loops
2020 · Benjamin Espinoza, Paul Gartside, et al. · Journal of Graph Theory · 3
PDF
Ubiquity in graphs II: Ubiquity of graphs with non-linear end structure
2018 · Nathan Bowler, Christian Elbracht, et al. · arXiv (Cornell University) · 3
Hamilton Cycles in Infinite Cubic Graphs
2018 · Max F. Pitz · The Electronic Journal of Combinatorics · 3
PDF
A representation theorem for end spaces of infinite graphs
2026 · JAN KURKOFKA, MAX PITZ · Mathematical Proceedings of the Cambridge Philosophical Society · 2
PDF
Ubiquity of locally finite graphs with extensive tree-decompositions
2024 · Nathan Bowler, Christian Elbracht, et al. · Combinatorial Theory · 2
The Nash-Williams orientation theorem for graphs with countably many ends
2024 · Amena Assem, Marcel Koloschin, et al. · European Journal of Combinatorics · 2
End spaces and tree-decompositions
2023 · Marcel Koloschin, Thilo Krill, et al. · Journal of Combinatorial Theory Series B · 2
PDF
Works count: 80
Citation count: 170
H-index: 7
I10-index: 2
Year
Topic
Type