Entanglements

05/23/2022
by   Johannes Carmesin, et al.
0

Robertson and Seymour constructed for every graph G a tree-decomposition that efficiently distinguishes all the tangles in G. While all previous constructions of these decompositions are iterative in nature, we give an explicit one-step construction. The key ingredient is an axiomatisation of 'local properties' of tangles. Generalisations to locally finite graphs and matroids are also discussed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/02/2017

Non-branching tree-decompositions

We prove that if a graph has a tree-decomposition of width at most w, th...
research
11/21/2021

Geometric decompositions of the simplicial lattice and smooth finite elements in arbitrary dimension

Recently C^m-conforming finite elements on simplexes in arbitrary dimens...
research
10/08/2021

On Explicit Constructions of Extremely Depth Robust Graphs

A directed acyclic graph G=(V,E) is said to be (e,d)-depth robust if for...
research
06/22/2018

Acyclicity in finite groups and groupoids

We expound a simple construction of finite groups and groupoids whose Ca...
research
06/25/2018

Minimal Unimodal Decompositions on Trees

The decomposition of a density function on a domain into a minimal sum o...
research
01/28/2011

An Analysis of the Convergence of Graph Laplacians

Existing approaches to analyzing the asymptotics of graph Laplacians typ...
research
10/11/2019

Analysis of Co-Occurrence Patterns in Data through Modular and Clan Decompositions of Gaifman Graphs

Our team has recently demonstrated that clan decompositions of generaliz...

Please sign up or login with your details

Forgot password? Click here to reset