9 citations · 36 across the 12 of their papers we have counts for
19 papers · 1 filter
Stotting in positional games
Johannes Carmesin, Yannick Mogge
We introduce variants of the Maker-Breaker and Waiter-Client games, which we call \emph{stotting}, in which a player grants a slight advantage to the opponent. We prove that a winn…
Embedding simply connected 2-complexes in 3-space
Johannes Carmesin
Firstly, we characterise the embeddability of simply connected locally 3-connected 2-dimensional simplicial complexes in 3-space in a way analogous to Kuratowski's characterisation…
Canonical Decompositions of 3-Connected Graphs
Johannes Carmesin, Jan Kurkofka
We offer a new structural basis for the theory of 3-connected graphs, providing a unique decomposition of every such graph into parts that are either quasi 4-connected, wheels, or…
Dual matroids of 2-complexes -- revisited
Johannes Carmesin
We prove that simply connected local 2-dimensional simplicial complexes embed in 3-space if and only if their dual matroids are graphic. Examples are provided that the assumptions…
On Andreae's Ubiquity Conjecture
Johannes Carmesin
A graph is ubiquitous if for every graph that for every natural number contains vertex-disjoint -minors contains infinitely many vertex-disjoint -minors. Andr…
Characterising graphs with no subdivision of a wheel of bounded diameter
Johannes Carmesin
We prove that a graph has an r-bounded subdivision of a wheel if and only if it does not have a graph-decomposition of locality r and width at most two.