Max Pitz

26 papers Journal 26
YearRankTypeTitle / Venue / Authors
2025 J jnl
A Note on Uncountably Chromatic Graphs.
Electron. J. Comb.
Nathan J. Bowler, Max Pitz
2025 J jnl
Counterexamples Regarding Linked and Lean Tree-Decompositions of Infinite Graphs.
J. Graph Theory
Sandra Albrechtsen, Raphael W. Jacobs, Paul Knappe, Max Pitz
2025 J jnl
The Nash-Williams orientation theorem for graphs with countably many ends.
Eur. J. Comb.
Amena Assem, Marcel Koloschin, Max Pitz
2024 J jnl
Applications of Order Trees in Infinite Graphs.
Order
Max Pitz
2024 J jnl
The Number of Topological Types of Trees.
Comb.
Thilo Krill, Max Pitz
2024 J jnl
Ubiquity of locally finite graphs with extensive tree-decompositions.
Comb. Theory
Nathan J. Bowler, Christian Elbracht, Joshua Erde, Jochen Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen
2023 J jnl
A note on minor antichains of uncountable graphs.
J. Graph Theory
Max Pitz
2023 J jnl
End spaces and tree-decompositions.
J. Comb. Theory B
Marcel Koloschin, Thilo Krill, Max Pitz
2023 J jnl
Maker-Breaker Games on and.
J. Symb. Log.
Nathan J. Bowler, Florian Gut, Attila Joó, Max Pitz
2023 J jnl
Ubiquity of graphs with nowhere-linear end structure.
J. Graph Theory
Nathan J. Bowler, Christian Elbracht, Joshua Erde, Jochen Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen
2022 J jnl
Constructing Tree-Decompositions That Display All Topological Ends.
Comb.
Max Pitz
2022 J jnl
Topological ubiquity of trees.
J. Comb. Theory B
Nathan J. Bowler, Christian Elbracht, Joshua Erde, Jochen Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen
2021 J jnl
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs.
J. Comb. Theory B
Joshua Erde, Jochen Pascal Gollin, Attila Joó, Paul Knappe, Max Pitz
2021 J jnl
Approximating infinite graphs by normal trees.
J. Comb. Theory B
Jan Kurkofka, Ruben Melcher, Max Pitz
2021 J jnl
Base Partition for Mixed Families of Finitary and Cofinitary Matroids.
Comb.
Joshua Erde, Jochen Pascal Gollin, Attila Joó, Paul Knappe, Max Pitz
2021 J jnl
Bounding the Cop Number of a Graph by Its Genus.
SIAM J. Discret. Math.
Nathan J. Bowler, Joshua Erde, Florian Lehner, Max Pitz
2021 J jnl
Quickly Proving Diestel's Normal Spanning Tree Criterion.
Electron. J. Comb.
Max Pitz
2021 J jnl
Tangles and the Stone-Čech compactification of infinite graphs.
J. Comb. Theory B
Jan Kurkofka, Max Pitz
2020 J jnl
A unified existence theorem for normal spanning trees.
J. Comb. Theory B
Max Pitz
2020 J jnl
Circuits through prescribed edges.
J. Graph Theory
Paul Knappe, Max Pitz
2020 J jnl
Graph-like compacta: Characterizations and Eulerian loops.
J. Graph Theory
Benjamin Espinoza, Paul Gartside, Max Pitz
2020 J jnl
Hamilton decompositions of one-ended Cayley graphs.
J. Comb. Theory, Ser. B
Joshua Erde, Florian Lehner, Max Pitz
2018 J jnl
Hamilton Cycles in Infinite Cubic Graphs.
Electron. J. Comb.
Max Pitz
2018 J jnl
Non-reconstructible locally finite graphs.
J. Comb. Theory B
Nathan J. Bowler, Joshua Erde, Peter Heinig, Florian Lehner, Max Pitz
2018 J jnl
Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs.
Discret. Math.
Carl Bürger, Louis DeBiasio, Hannah Guggiari, Max Pitz
2017 J jnl
A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs.
Discret. Appl. Math.
Nathan J. Bowler, Joshua Erde, Florian Lehner, Martin Merker, Max Pitz, Konstantinos S. Stavropoulos