This paper investigates ultrafilters in the context of connectivity systems, defined as pairs
$(X, f) $ where $ X $ is a finite set and $ f $ is a symmetric submodular function. Ultrafilters …

Multi-photon entangled graph states are a fundamental resource in quantum communication
networks, distributed quantum computing, and sensing. These states can in principle be …

Classes with bounded rankwidth are MSO-transductions of trees and classes with bounded
linear rankwidth are MSO-transductions of paths–a result that shows a strong link between …

Given n subspaces of a finite-dimensional vector space over a fixed finite field \mathbbF, we
wish to find a “branch-decomposition” of these subspaces of width at most k that is a …

We give an algorithm that given a graph G with n vertices and m edges and an integer k, in
time O k (n 1+ o (1))+ O (m) either outputs a rank decomposition of G of width at most k or …

In the companion paper (Adler et al., 2017), we presented a characterization of the linear
rank-width of distance-hereditary graphs, from which we derived an algorithm to compute it …

In this work, we give a structural lemma on merges of typical sequences, a notion that was
introduced in 1991 [Lagergren and Arnborg, Bodlaender and Kloks, both ICALP 1991] to …

Every minor-closed class of matroids of bounded branch-width can be characterized by a list
of excluded minors, but unlike graphs, this list may need to be infinite in general. However …

Lettericity is a graph parameter responsible for many attractive structural properties. In
particular, graphs of bounded lettericity have bounded linear clique-width and they are well …

Tree-width and its linear variant path-width play a central role for the graph minor relation. In
particular, Robertson and Seymour J. Combin. Theory Ser. B, 35 (1983), pp. 39--61 proved …