Maximilian Teegen

activity

20182021

most citedTrees of tangles in abstract separation systems

13 citations · 33 across the 14 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018

Tangles are Decided by Weighted Vertex Sets

Christian Elbracht, Jay Lilian Kneip, Maximilian Teegen

We show that, given a $k$ -tangle $τ$ in a graph $G$ , there always exists a weight function $w : V (G) \to N$ such that a separation $(A, B)$ of $G$ of order $ {…

math.CO2018

Ubiquity in graphs II: Ubiquity of graphs with nowhere-linear end structure

Nathan Bowler, Christian Elbracht, Joshua Erde +4

A graph $G$ is said to be $⪯$ -ubiquitous, where $⪯$ is the minor relation between graphs, if whenever $Γ$ is a graph with $n G ⪯ Γ$ for all $n \in N$ , the…

math.CO2018★ 1 cited

Ubiquity in graphs I: Topological ubiquity of trees

Nathan Bowler, Christian Elbracht, Joshua Erde +4

Let $◃$ be a relation between graphs. We say a graph $G$ is \emph{ $◃$ -ubiquitous} if whenever $Γ$ is a graph with $n G ◃ Γ$ for all $n \in \mathb…