5 citations · 7 across the 10 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2022
Evolutions of finite graphs
Stefan Geschke, Szymon Głąb, Wiesław Kubiś
Every countable graph can be built from finite graphs by a suitable infinite process, either adding new vertices randomly or imposing some rules on the new edges. On the other hand…
math.CO2020
Halin's end degree conjecture
Stefan Geschke, Jan Kurkofka, Ruben Melcher +1
An end of a graph is an equivalence class of rays, where two rays are equivalent if there are infinitely many vertex-disjoint paths between them in . The degree of an end is…
math.CO2016
Minimal obstructions for normal spanning trees
Nathan Bowler, Stefan Geschke, Max Pitz
Diestel and Leader have characterised connected graphs that admit a normal spanning tree via two classes of forbidden minors. One class are Halin's -graphs: bi…