相关论文: A Bramble like Witness for Large Branch-Width

Tangle-tree theorems are an important tool in structural graph theory, and abstract separation systems are a very general setting in which tangle-tree theorems can still be formulated and proven. For infinite abstract separation systems, so…

It is shown how derived brackets naturally arise in sigma-models via Poisson- or antibracket, generalizing a recent observation by Alekseev and Strobl. On the way to a precise formulation of this relation, an explicit coordinate expression…

Tree-cut width is a graph parameter introduced by Wollan that is an analogue of treewidth for the immersion order on graphs in the following sense: the tree-cut width of a graph is functionally equivalent to the largest size of a wall that…

Formal orbifolds are defined in higher dimension. Their \'etale fundamental groups are also defined. It is shown that the fundamental groups of formal orbifolds have certain finiteness property and it is also shown that they can be used to…

We use operators from generalized equiangular measurements to construct positive maps. Their positivity follows from the inequality for indices of coincidence corresponding to few equiangular tight frames. These maps give rise to…

We extend Edmonds' Branching Theorem to locally finite infinite digraphs. As examples of Oxley or Aharoni and Thomassen show, this cannot be done using ordinary arborescences, whose underlying graphs are trees. Instead we introduce the…

$\Lambda$-coalescents model genealogies of samples of individuals from a large population by means of a family tree whose branches have lengths. The tree's leaves represent the individuals, and the lengths of the adjacent edges indicate the…

We investigate a class of entanglement witnesses where each witness is formulated as a difference of two product observables. These observables are decomposable into positive semidefinite local operators that obey a partial ordering rule…

We study the problem of witnessing entanglement among indistinguishable particles. For this purpose, we derive a set of equations which results in necessary and sufficient conditions for probing multipartite entanglement between arbitrary…

In Chapter 1 we fully characterise pairs of finite graphs which form a gap in the full homomorphism order. This leads to a simple proof of the existence of generalised duality pairs. We also discuss how such results can be carried to…

In a witness rectangle graph (WRG) on vertex point set P with respect to witness points set W in the plane, two points x, y in P are adjacent whenever the open isothetic rectangle with x and y as opposite corners contains at least one point…

We introduce a comprehensive data structure, tangle structure trees, which simultaneously displays all the $\mathcal{F}$-tangles of an abstract separation system for very general obstruction sets $\mathcal{F}$. It simultaneously also…

Building on techniques from complex analysis and topology, we establish a remarkable property of branched covers and formulate a complete criterion for the existence of specific types of branched covers between 2-spheres. Our results extend…

In their study of the giant component in inhomogeneous random graphs, Bollob\'as, Janson, and Riordan introduced a class of branching processes parametrized by a possibly unbounded graphon. We prove that the tree structures underlying two…

Gurski and Wanke showed that a graph class C has bounded tree-width if and only if its associated class of directed line graphs has bounded clique-width. Inevitably -- asking whether this relationship lifts to directed graphs -- we…

Tangle is a concept in graph theory that has a dual relationship with branch-width which is well-known graph width parameter. Ultrafilter, a fundamental notion in mathematics, is similarly known to have a dual relationship with branch-width…

We survey results on the pebbling numbers of graphs as well as their historical connection with a number-theoretic question of Erd\H os and Lemke. We also present new results on two probabilistic pebbling considerations, first the random…

It was recently shown that a large class of phylogenetic networks, the `labellable' networks, is in bijection with the set of `expanding' covers of finite sets. In this paper, we show how several prominent classes of phylogenetic networks…

We introduce the concept of entanglement width as measure of the spatial distribution of entanglement in multiparticle systems. We develop criteria to detect the width of entanglement using global observables such as energy and magnetic…

Brambles were introduced as the dual notion to treewidth, one of the most central concepts of the graph minor theory of Robertson and Seymour. Recently, Grohe and Marx showed that there are graphs G, in which every bramble of order larger…