Max F. Pitz

From MaRDI portal


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
The Nash-Williams orientation theorem for graphs with countably many ends
European Journal of Combinatorics
2024-12-27Paper
Bounding the cop number of a graph by its genus
Acta Mathematica Universitatis Comenianae. New Series
2024-10-18Paper
Ubiquity of locally finite graphs with extensive tree-decompositions
Combinatorial Theory
2024-10-08Paper
Halin's end degree conjecture
 
2024-09-13Paper
Applications of Order Trees in Infinite Graphs
Order
2024-04-29Paper
Eulerian Spaces
Memoirs of the American Mathematical Society
2024-02-20Paper
Universal end-compactifications of locally finite graphs
Topology and its Applications
2024-02-09Paper
Ubiquity of graphs with nowhere‐linear end structure
Journal of Graph Theory
2023-10-12Paper
A note on minor antichains of uncountable graphs
Journal of Graph Theory
2023-10-06Paper
The Nash-Williams orientation theorem for graphs with countably many ends
 
2023-10-05Paper
A strengthening of Halin's grid theorem
Mathematika
2023-09-20Paper
MAKER–BREAKER GAMES ON AND
Journal of Symbolic Logic
2023-06-05Paper
The number of topological types of trees
 
2023-05-23Paper
End spaces and tree-decompositions
Journal of Combinatorial Theory. Series B
2023-05-02Paper
Halin's end degree conjecture
Israel Journal of Mathematics
2023-04-24Paper
Characterising path-, ray- and branch spaces of order trees, and end spaces of infinite graphs
 
2023-03-01Paper
Constructing tree-decompositions that display all topological ends
Combinatorica
2023-01-23Paper
\(n\)-arc connected graphs
Colloquium Mathematicum
2022-11-28Paper
Topological ubiquity of trees
Journal of Combinatorial Theory. Series B
2022-09-23Paper
Proof of Halin's normal spanning tree conjecture
Israel Journal of Mathematics
2022-04-25Paper
Graph‐like compacta: Characterizations and Eulerian loops
Journal of Graph Theory
2022-03-31Paper
Constructing tree-decompositions that display all topological ends
 
2021-12-02Paper
Bounding the cop number of a graph by its genus
SIAM Journal on Discrete Mathematics
2021-11-04Paper
A new obstruction for normal spanning trees
Bulletin of the London Mathematical Society
2021-10-01Paper
Quickly proving Diestel's normal spanning tree criterion
The Electronic Journal of Combinatorics
2021-09-28Paper
Base partition for mixed families of finitary and cofinitary matroids
Combinatorica
2021-06-29Paper
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
Journal of Combinatorial Theory. Series B
2021-06-18Paper
Approximating infinite graphs by normal trees
Journal of Combinatorial Theory. Series B
2021-03-08Paper
Tangles and the Stone-Čech compactification of infinite graphs
Journal of Combinatorial Theory. Series B
2021-02-03Paper
Ubiquity in graphs III: Ubiquity of locally finite graphs with extensive tree-decompositions
 
2020-12-23Paper
Orientations of infinite graphs
 
2020-11-11Paper
Halin's end degree conjecture
 
2020-10-20Paper
A unified existence theorem for normal spanning trees
Journal of Combinatorial Theory. Series B
2020-09-24Paper
Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths
Israel Journal of Mathematics
2020-09-15Paper
Circuits through prescribed edges
Journal of Graph Theory
2020-05-21Paper
Hamilton decompositions of one-ended Cayley graphs
Journal of Combinatorial Theory. Series B
2020-01-15Paper
Ends, tangles and critical vertex sets
Mathematische Nachrichten
2019-12-05Paper
\(n\)-arc and \(n\)-circle connected graph-like spaces
Topology and its Applications
2019-03-13Paper
Non-reconstructible locally finite graphs
Journal of Combinatorial Theory. Series B
2018-10-11Paper
Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs
Discrete Mathematics
2018-09-21Paper
Ubiquity in graphs II: Ubiquity of graphs with nowhere-linear end structure
 
2018-09-03Paper
Hamilton cycles in infinite cubic graphs
The Electronic Journal of Combinatorics
2018-08-15Paper
Ubiquity in graphs I: Topological ubiquity of trees
 
2018-06-11Paper
Minimal obstructions for normal spanning trees
Fundamenta Mathematicae
2018-04-10Paper
Decomposing edge-coloured complete symmetric digraphs into monochromatic paths
 
2017-11-23Paper
A counterexample to the reconstruction conjecture for locally finite trees
Bulletin of the London Mathematical Society
2017-09-13Paper
A counterexample to montgomery's conjecture on dynamic colourings of regular graphs
Discrete Applied Mathematics
2017-07-27Paper
Reconstructing topological graphs and continua
Colloquium Mathematicum
2017-05-10Paper
A topological variation of the reconstruction conjecture
Glasgow Mathematical Journal
2017-04-28Paper
Reconstructing compact metrizable spaces
Proceedings of the American Mathematical Society
2016-11-14Paper
Self-maps under the compact-open topology
Topology and its Applications
2016-10-13Paper
Graph-Like Compacta: Characterizations and Eulerian Loops
 
2016-09-04Paper
Compactifications of \(\omega^*\setminus\{x\}\) and \(S_\kappa\setminus\{x\}\)
 
2015-02-18Paper
The space $\omega^*$ and the reconstruction of normality
 
2015-01-20Paper
Finite compactifications of $\omega^* \setminus \{x\}$
 
2013-11-21Paper
A representation theorem for end spaces of infinite graphs
 
N/APaper
A note on uncountably chromatic graphs
 
N/APaper


Research outcomes over time


This page was built for person: Max F. Pitz