Über die Maximalzahl fremder unendlicher Wege in Graphen

From MaRDI portal
Publication:5339969

DOI10.1002/mana.19650300106zbMath0131.20904OpenAlexW1969829602MaRDI QIDQ5339969

Rudolf Halin

Publication date: 1965

Published in: Mathematische Nachrichten (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/mana.19650300106




Related Items (53)

Self-avoiding walks and multiple context-free languagesMinimax theorems for infinite graphs with the ends as ideal pointsFinitary and cofinitary gammoidsTHEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSISMinimization Problems for Infinite n-Connected GraphsA maximum principle for node voltages in finitely structured, transfinite, electrical networksEnds of graphsTopological ubiquity of treesCharacterising \(k\)-connected sets in infinite graphsThe Reidemeister graph is a complete knot invariantRandom walks on finitely structured transfinite networksEnds and tanglesExcluding a full grid minorUbiquity of graphs with nowhere‐linear end structureA strengthening of Halin's grid theoremGrid minors in damaged gridsOn a problem of R. Halin concerning infinite graphs. IIALMOST THEOREMS OF HYPERARITHMETIC ANALYSISOn Andreae's ubiquity conjectureTHE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREESComputability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)Halin's end degree conjectureAn edge-deletion problem for locally finite graphsDuality of EndsBounded graphsExcluding infinite minorsAnalogues of Cayley graphs for topological groupsInfinite end-devouring sets of rays with prescribed start verticesOn vertex transitive graphs of infinite degreeDecompositions of infinite graphs. II: Circuit decompositionsForcing finite minors in sparse infinite graphs by large-degree assumptionsA short proof of Halin's grid theoremA problem in infinite graph-theoryThe limb analysis of countably infinite electrical networksLocally finite graphs with ends: A topological approach. II: ApplicationsSome path problems in graph theoryExtremal infinite graph theoryÜber eine Eigenschaft lokalfiniter, unendlicher Bäume. (On a property of locally finite infinite trees)A note on graphs with countable automorphism groupUnnamed ItemUbiquity and the Farey graphOn a problem of R. Halin concerning infinite graphsBemerkung zu einem Problem aus der Theorie der unendlichen GraphenMulti-Faithful Spanning Trees of Infinite GraphsOn translations of double rays in graphsOn the Hadwiger number of infinite graphsCardinal characteristics on graphsA note on the growth of transitive graphsEcken n-ten Grades in minimalen n-fach zusammenhängenden GraphenUnendliche minimale \(n\)-fach zusammenhängende GraphenAutomorphisms and endomorphisms of infinite locally finite graphsEnds in digraphsOn the immersion relation and an embedding problem for infinite graphs




This page was built for publication: Über die Maximalzahl fremder unendlicher Wege in Graphen