English
Related papers

Related papers: A tree-of-tangles theorem for infinite tangles

200 papers

The Matrix-Tree Theorem states that the number of spanning trees of a graph is given by the absolute value of any cofactor of the Laplacian matrix of the graph. We propose a very short proof of this result which amounts to comparing Taylor…

Combinatorics · Mathematics 2023-03-14 Amitai Netser Zernik

The present paper is the first one in the sequence of papers about a simple class of {\em framed $4$-graphs}; the goal of the present paper is to collect some well-known results on planarity and to reformulate them in the language of {\em…

Combinatorics · Mathematics 2014-02-10 Vassily Olegovich Manturov

We introduce torsoids, a canonical structure in matching covered graphs, corresponding to the bricks and braces of the graph. This allows a more fine-grained understanding of the structure of finite and infinite directed graphs with respect…

Combinatorics · Mathematics 2023-05-17 Nathan Bowler , Florian Gut , Meike Hatzel , Ken-ichi Kawarabayashi , Irene Muzi , Florian Reich

We generalize the concept of token graphs to obtain supertoken graphs. In the latter case, there can be more than one token in a vertex. We formally define supertoken graphs and establish their basic properties. Moreover, we provide some…

Combinatorics · Mathematics 2026-04-08 Mónica A. Reyes , Cristina Dalfó , Miquel Àngel Fiol

We study some versions of the statement of Hadwiger's conjecture for finite as well as infinite graphs.

Combinatorics · Mathematics 2016-10-04 Dominic van der Zypen

We study the limit theory of large threshold graphs and apply this to a variety of models for random threshold graphs. The results give a nice set of examples for the emerging theory of graph limits.

Combinatorics · Mathematics 2009-08-19 Persi Diaconis , Susan Holmes , Svante Janson

In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered…

Discrete Mathematics · Computer Science 2009-07-16 Craig Weidert

We prove that certain classes of metrically homogeneous graphs omitting triangles of odd short perimeter as well as triangles of long perimeter have the extension property for partial automorphisms and we describe their Ramsey expansions.

We present a comprehensive analysis of Bredon's trick, a powerful local-to-global extension principle with broad applications across differential geometry and computational topology. Our main contributions include: (1) novel applications to…

Differential Geometry · Mathematics 2025-07-08 Mauricio Angel

This list presents problems in the Reverse Mathematics of infinitary Ramsey theory which I find interesting but do not personally have the techniques to solve. The intent is to enlist the help of those working in Reverse Mathematics to take…

Logic · Mathematics 2018-08-31 Natasha Dobrinen

This paper is intended as an introductory survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends,…

Combinatorics · Mathematics 2012-07-11 Reinhard Diestel

We consider the problem of constructing a weakly-continuous mapping extending continuous mapping defined on a dense set of a topological space to the entire space. Theorem on necessary and sufficient conditions for the existence of such an…

General Topology · Mathematics 2026-03-04 Andrew Ryabikov

We show how an image can, in principle, be described by the tangles of the graph of its pixels. The tangle-tree theorem provides a nested set of separations that efficiently distinguish all the distinguishable tangles in a graph. This…

Combinatorics · Mathematics 2017-11-09 Reinhard Diestel , Geoff Whittle

We prove that a minor-closed class of graphs has bounded layered pathwidth if and only if some apex-forest is not in the class. This generalises a theorem of Robertson and Seymour, which says that a minor-closed class of graphs has bounded…

Combinatorics · Mathematics 2020-08-03 Vida Dujmović , David Eppstein , Gwenaël Joret , Pat Morin , David R. Wood

We show that if a subset $\Psi$ of the ends of a graph $G$ can be displayed by a tree-decomposition of finite adhesion, then it can also be displayed by a linked such tree-decomposition. This tree-decomposition captures all combinatorial…

Combinatorics · Mathematics 2025-12-16 Sandra Albrechtsen , Max Pitz , Roman Schaut

In the present paper we obtain a new homological version of the implicit function theorem and some versions of the Darboux theorem. Such results are proved for continuous maps on topological manifolds. As a consequence, some versions of…

Algebraic Topology · Mathematics 2007-06-28 Carlos Biasi , Carlos Gutierrez , Edivaldo L. dos Santos

We discuss Nakamaye's Theorem and its recent extension to compact complex manifolds, together with some applications.

Algebraic Geometry · Mathematics 2019-04-04 Valentino Tosatti

For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…

Combinatorics · Mathematics 2018-02-28 Daniele D'Angeli , Alfredo Donno

The paper contains an exposition of part of topology using partitions of unity. The main idea is to create variants of the Tietze Extension Theorem and use them to derive classical theorems. This idea leads to a new result generalizing…

General Topology · Mathematics 2008-02-28 Jerzy Dydak

We answer two questions about the topology of end spaces of infinite type surfaces and the action of the mapping class group that have appeared in the literature. First, we give examples of infinite type surfaces with end spaces that are…

Geometric Topology · Mathematics 2022-03-16 Kathryn Mann , Kasra Rafi