5 citations · 7 across the 10 of their papers we have counts for
12 papers
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…
Borel chromatic numbers of closed graphs and forcing with uniform trees
Michel Gaspar, Stefan Geschke
In this work, we continue the tradition initiated by Geschke, 2011 of viewing the uncountable Borel chromatic number of analytic graphs as cardinal invariants of the continuum. We…
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…
Scrambled Cantor sets
Stefan Geschke, Jan Grebík, Benjamin D. Miller
We show that Li-Yorke chaos ensures the existence of a scrambled Cantor set.
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…
Separable linear orders and universality
Stefan Geschke
In various places in the literature it is stated that every separable linear order embeds into the real line. This is, however, not the case, at least not with respect to the usual…