Search Results for author:
Found 3 papers, 1 papers with code
Ubiquity in graphs III: Ubiquity of locally finite graphs with extensive tree-decompositions
A graph $G$ is said to be ubiquitous, if every graph $\Gamma$ that contains arbitrarily many disjoint $G$-minors automatically contains infinitely many disjoint $G$-minors.
Combinatorics 05C63, 05C83
Edge-connectivity and tree-structure in finite and infinite graphs
We show that every graph admits a canonical tree-like decomposition into its $k$-edge-connected pieces for all $k\in\mathbb{N}\cup\{\infty\}$ simultaneously.
Combinatorics Discrete Mathematics 05C40 (Primary), 05C05, 05C69, 05C70, 05C83, 05C63 (Secondary)
Clustering with Tangles: Algorithmic Framework and Theoretical Guarantees
Given a collection of cuts of any dataset, tangles aggregate these cuts to point in the direction of a dense structure.
