Zobrazeno 1 - 10
of 355
pro vyhledávání: '"Diestel, Reinhard"'
Autor:
Albrechtsen, Sandra, Diestel, Reinhard, Elm, Ann-Kathrin, Fluck, Eva, Jacobs, Raphael W., Knappe, Paul, Wollan, Paul
Given an arbitrary class $\mathcal{H}$ of graphs, we investigate which graphs admit a decomposition modelled on a graph in $\mathcal{H}$ into parts of small radius. The $\mathcal{H}$-decompositions that we consider here generalise the notion of tree-
Externí odkaz:
http://arxiv.org/abs/2307.08497
We show that a graph contains a large wall as a strong immersion minor if and only if the graph does not admit a tree-cut decomposition of small `width', which is measured in terms of its adhesion and the path-likeness of its torsos.
Comment: 15
Comment: 15
Externí odkaz:
http://arxiv.org/abs/2301.05134
We present a canonical way to decompose finite graphs into highly connected local parts. The decomposition depends only on an integer parameter whose choice sets the intended degree of locality. The global structure of the graph, as determined by the
Externí odkaz:
http://arxiv.org/abs/2207.04855
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 elements $y$ of $Y\!$ map to subsets $X_y$ of $X$, so that $x\in X_y$
Externí odkaz:
http://arxiv.org/abs/2109.08398
Tangles, as introduced by Robertson and Seymour, were designed as an indirect way of capturing clusters in graphs and matroids. They have since been shown to capture clusters in much broader discrete structures too. But not all tangles are induced by
Externí odkaz:
http://arxiv.org/abs/2107.01087
Autor:
Diestel, Reinhard
We define an algebraic setup of homology for hypergraphs, which defaults to simplicial homology in the case of graphs, and study its basic properties. As part of our study we define algebraic spanning trees of hypergraphs, along with fundamental cuts
Externí odkaz:
http://arxiv.org/abs/2007.09125
Autor:
Diestel, Reinhard
Traditional clustering identifies groups of objects that share certain qualities. Tangles do the converse: they identify groups of qualities that often occur together. They can thereby discover, relate, and structure types: of behaviour, political vi
Externí odkaz:
http://arxiv.org/abs/2006.01830
Autor:
Diestel, Reinhard
Traditional clustering identifies groups of objects that share certain qualities. Tangles do the converse: they identify groups of qualities that often occur together. They can thereby identify and discover 'types': of behaviour, views, abilities, di
Externí odkaz:
http://arxiv.org/abs/1907.07341
We prove a tangle-tree theorem and a tangle duality theorem for abstract separation systems $\vec S$ that are submodular in the structural sense that, for every pair of oriented separations, $\vec S$ contains either their meet or their join defined i
Externí odkaz:
http://arxiv.org/abs/1805.01439