C. Elbracht

activity

20182021

most citedDuality and tangles of set separations

1 citations · 1 across the 1 of their papers we have counts for

collaborators

5 papers

math.CO2021★ 1 cited

Duality and tangles of set separations

Reinhard Diestel, Christian Elbracht, Joshua Erde +1

Applications of tangles of connectivity systems suggest a duality between these, in which for two sets $X$ and $Y$ the elements $x$ of $X$ map to subsets $Y_{x}$ of $Y$ , and the…

math.CO2020

Ubiquity in graphs III: Ubiquity of locally finite graphs with extensive tree-decompositions

Nathan Bowler, Christian Elbracht, Joshua Erde +4

A graph $G$ is said to be ubiquitous, if every graph $Γ$ that contains arbitrarily many disjoint $G$ -minors automatically contains infinitely many disjoint $G$ -minors. The well-kno…

math.CO2020

Edge-connectivity and tree-structure in finite and infinite graphs

Christian Elbracht, Jan Kurkofka, Maximilian Teegen

We show that every graph admits a canonical tree-like decomposition into its $k$ -edge-connected pieces for all $k \in N \cup {\infty}$ simultaneously.

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

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…