The following pages link to Max F. Pitz (Q321407):
Displaying 50 items.
- Self-maps under the compact-open topology (Q321408) (← links)
- (Q820853) (redirect page) (← links)
- Quickly proving Diestel's normal spanning tree criterion (Q820854) (← links)
- Hamilton cycles in infinite cubic graphs (Q1658776) (← links)
- \(n\)-arc and \(n\)-circle connected graph-like spaces (Q1731329) (← links)
- Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs (Q1783629) (← links)
- Non-reconstructible locally finite graphs (Q1791706) (← links)
- Approximating infinite graphs by normal trees (Q1998763) (← links)
- A counterexample to montgomery's conjecture on dynamic colourings of regular graphs (Q2012068) (← links)
- A Cantor-Bernstein-type theorem for spanning trees in infinite graphs (Q2033907) (← links)
- Base partition for mixed families of finitary and cofinitary matroids (Q2036617) (← links)
- Proof of Halin's normal spanning tree conjecture (Q2130550) (← links)
- Topological ubiquity of trees (Q2171012) (← links)
- Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths (Q2200044) (← links)
- A unified existence theorem for normal spanning trees (Q2200933) (← links)
- Tangles and the Stone-Čech compactification of infinite graphs (Q2221916) (← links)
- Hamilton decompositions of one-ended Cayley graphs (Q2284729) (← links)
- Constructing tree-decompositions that display all topological ends (Q2678454) (← links)
- Halin's end degree conjecture (Q2698436) (← links)
- Reconstructing compact metrizable spaces (Q2832841) (← links)
- A TOPOLOGICAL VARIATION OF THE RECONSTRUCTION CONJECTURE (Q2976253) (← links)
- Reconstructing topological graphs and continua (Q2985940) (← links)
- Minimal obstructions for normal spanning trees (Q4634593) (← links)
- $n$-Arc connected graphs (Q5053808) (← links)
- Graph‐like compacta: Characterizations and Eulerian loops (Q5066919) (← links)
- Circuits through prescribed edges (Q5110668) (← links)
- A new obstruction for normal spanning trees (Q5153933) (← links)
- Bounding the Cop Number of a Graph by Its Genus (Q5163511) (← links)
- The Stone-Cech compactifications of $\omega^*\setminus \{x\}$ and $S_\kappa\setminus\{x\}$ (Q5174644) (← links)
- Ends, tangles and critical vertex sets (Q5204867) (← links)
- A counterexample to the reconstruction conjecture for locally finite trees (Q5357097) (← links)
- End spaces and tree-decompositions (Q6038587) (← links)
- A note on minor antichains of uncountable graphs (Q6046688) (← links)
- Ubiquity of graphs with nowhere‐linear end structure (Q6074597) (← links)
- A strengthening of Halin's grid theorem (Q6074968) (← links)
- MAKER–BREAKER GAMES ON AND (Q6103459) (← links)
- Universal end-compactifications of locally finite graphs (Q6191227) (← links)
- Eulerian Spaces (Q6201446) (← links)
- Halin's end degree conjecture (Q6351790) (← links)
- Constructing tree-decompositions that display all topological ends (Q6384661) (← links)
- The number of topological types of trees (Q6437651) (← links)
- Applications of Order Trees in Infinite Graphs (Q6493755) (← links)
- A representation theorem for end spaces of infinite graphs (Q6507667) (← links)
- A note on uncountably chromatic graphs (Q6521000) (← links)
- Halin's end degree conjecture (Q6604676) (← links)
- Ubiquity of locally finite graphs with extensive tree-decompositions (Q6615520) (← links)
- Bounding the cop number of a graph by its genus (Q6621170) (← links)
- The Nash-Williams orientation theorem for graphs with countably many ends (Q6655682) (← links)
- Linked tree-decompositions into finite parts (Q6728303) (← links)
- Counterexamples regarding linked and lean tree-decompositions of infinite graphs (Q6728304) (← links)
