Related papers: The excluded 3-minors for vf-safe delta-matroids
Cylindrical Algebraic Decomposition (CAD) algorithms typically produce a decomposition adapted to a finite family of semi-algebraic sets $\mathcal{F}$ (i.e. every member of $\mathcal{F}$ is a union of cells). Different algorithms may…
A detection system, modeled in a graph, is composed of "detectors" positioned at a subset of vertices in order to uniquely locate an ``intruder" at any vertex. \emph{Identifying codes} use detectors that can sense the presence or absence of…
Consider a matroid equipped with a labeling of its ground set to an abelian group. We define the label of a subset of the ground set as the sum of the labels of its elements. We study a collection of problems on finding bases and common…
In his pioneering paper on matroids in 1935, Whitney obtained a characterization for binary matroids and left a comment at end of the paper that the problem of characterizing graphic matroids is the same as that of characterizing matroids…
A result of Seymour implies that any 3-connected matroid with a modular 3-point line is binary. We prove a similar characterization for 3-connected matroids with modular 4-point lines. We show that such a matroid is either representable…
Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids. Here we consider a special case of…
Several problems such as network intrusion, community detection, and disease outbreak can be described by observations attributed to nodes or edges of a graph. In these applications presence of intrusion, community or disease outbreak is…
A prominent tool in many problems involving metric spaces is a notion of randomized low-diameter decomposition. Loosely speaking, $\beta$-decomposition refers to a probability distribution over partitions of the metric into sets of low…
Let $\mathcal{D}_k$ be the class of graphs for which every minor has minimum degree at most $k$. Then $\mathcal{D}_k$ is closed under taking minors. By the Robertson-Seymour graph minor theorem, $\mathcal{D}_k$ is characterised by a finite…
We present extensive first principles density functional theory (DFT) calculations dedicated to analyze the magnetic and electronic properties of small V$_{n}$ clusters (n=1,2,3,4,5,6) embedded in a Cu fcc matrix. We consider different…
We study constraints on the space of $d=2$ fermionic CFTs as a function of non-perturbative anomalies exhibited under a fermionic discrete symmetry group $G^f$, focusing our attention also on cases where $G^f$ is non-abelian or presents a…
We find the excluded minors for the minor-closed class of lattice path polymatroids as a subclass of the minor-closed class of Boolean polymatroids. Like lattice path matroids and Boolean polymatroids, there are infinitely many excluded…
Forbidden minors and subdivisions for toroidal graphs are numerous. We consider the toroidal graphs with no $K_{3,3}$-subdivisions that coincide with the toroidal graphs with no $K_{3,3}$-minors. These graphs admit a unique decomposition…
A binary frame template is a device for creating binary matroids from graphic or cographic matroids. Such matroids are said to conform or coconform to the template. We introduce a preorder on these templates and determine the nontrivial…
In a recent paper by a superset of the authors it was proved that for every primitive 3-constrained space $\Gamma$ of finite diameter $\delta$ from Cherlin's catalogue of metrically homogeneous graphs, there exists a finite family $\mathcal…
In 1963, Halin and Jung proved that every simple graph with minimum degree at least four has $K_5$ or $K_{2,2,2}$ as a minor. Mills and Turner proved an analog of this theorem by showing that every $3$-connected binary matroid in which…
Front-door adjustment gives a simple closed-form identification formula under the classical front-door criterion, but its applicability is often viewed as narrow. By contrast, the general ID algorithm can identify many more causal effects…
We prove that given any $\alpha$-approximation LOCAL algorithm for Minimum Dominating Set (MDS) on planar graphs, we can construct an $f(g)$-round $(3\alpha+1)$-approximation LOCAL algorithm for MDS on graphs embeddable in a given Euler…
We establish rigidity theorems for graph product von Neumann algebras $M_\Gamma=*_{v,\Gamma}M_v$ associated to finite simple graphs $\Gamma$ and families of tracial von Neumann algebras $(M_v)_{v\in\Gamma}$. We consider the following three…
We introduce dual matroids of 2-dimensional simplicial complexes. Under certain necessary conditions, duals matroids are used to characterise embeddability in 3-space in a way analogous to Whitney's planarity criterion. We further use dual…