Related papers: Duality theorems for blocks and tangles in graphs
Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if, and only if, they are homomorphism indistinguishable over all graphs, i.e., $G$ and $H$ admit the same number of number of homomorphisms from every graph $F$.…
Recently the duality map between electric-like asymptotic charges of $p$-form gauge theories is studied. The outcome is an existence and uniqueness theorem and the topological nature of the duality map. The goal of this work is to extend…
There are numerous generalizations of the celebrated Priestley duality for bounded distributive lattices to the non-distributive setting. The resulting dualities rely on an earlier foundational work of such authors as Nachbin,…
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,…
Ramsey--Tur\'an theory considers Tur\'an type questions in Ramsey-context, asking for the existence of a small subgraph in a graph $G$ where the complement $\overline{G}$ lacks an appropriate subgraph $F$, such as a clique of linear size.…
In the 1960s, Erd\H{o}s and P\'osa proved that there is a packing-covering duality for cycles in graphs. As part of the graph minor project, Robertson and Seymour greatly extended this: there is such a duality for $H$-expansions in graphs…
Partial duality is a duality of ribbon graphs relative to a subset of their edges generalizing the classical Euler-Poincare duality. This operation often changes the genus. Recently J.L.Gross, T.Mansour, and T.W.Tucker formulated a…
While finite graphs have tree-decompositions that efficiently distinguish all their tangles, locally finite graphs with thick ends need not have such tree-decompositions. We show that every locally finite graph without thick ends admits…
A rough structure theorem is proved for graphs $G$ containing no copy of a bounded degree tree $T$: from any such $G$, one can delete $o(|G||T|)$ edges in order to get a subgraph all of whose connected components have a cover of order…
In this note, we show that for any harmonic map into a non-compact symmetric space one can find naturally a "dual" harmonic map into a compact symmetric space which can be constructed from the same basic data (called "potentials" in the…
We present the dual formulation of double field theory at the linearized level. This is a classically equivalent theory describing the duals of the dilaton, the Kalb-Ramond field and the graviton in a T-duality or O(D,D) covariant way. In…
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…
An account of 2-factors in graphs and their history is presented. We give a direct graph-theoretic proof of the 2-Factor Theorem and a new variant of it, and also a new complete characterisation of the maximal graphs without 2-factors. This…
A duality theory of bundles of C$^*$-algebras whose fibres are twisted transformation group algebras is established. Classical T-duality is obtained as a special case, where all fibres are commutative tori, i.e. untwisted group algebras for…
We investigate a structural generalisation of treewidth we call $\mathcal{A}$-blind-treewidth where $\mathcal{A}$ denotes an annotated graph class. This width parameter is defined by evaluating only the size of those bags $B$ of…
We show that every connected graph has a spanning tree that displays all its topological ends. This proves a 1964 conjecture of Halin in corrected form, and settles a problem of Diestel from 1992.
Ramsey theory is a central and active branch of combinatorics. Although Ramsey numbers for graphs have been extensively investigated since Ramsey's work in the 1930s, there is still an exponential gap between the best known lower and upper…
Courcelle's Theorem is an important result in graph theory, proving the existence of linear-time algorithms for many decision problems on graphs whose tree-width is bounded by a constant. The purpose of this text is twofold: to provide an…
We prove a Tannaka duality theorem for $(\infty,1)$-categories. This is a duality between certain derived group stacks, or more generally certain derived gerbes, and symmetric monoidal $(\infty,1)$-categories endowed with particular…
The Tree Decomposition Conjecture by Bar\'at and Thomassen states that for every tree $T$ there exists a natural number $k(T)$ such that the following holds: If $G$ is a $k(T)$-edge-connected simple graph with size divisible by the size of…