Related papers: Duality theorems for stars and combs III: Undomina…
We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…
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…
We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph $H$ as a minor to graphs excluding $H$ as a topological subgraph. We prove that for a fixed $H$, every graph excluding $H$ as a topological…
Gross, Mansour and Tucker introduced the partial-dual orientable genus polynomial and the partial-dual Euler genus polynomial. They computed these two partial-dual genus polynomials of four families of ribbon graphs, posed some research…
A set $S$ of vertices in a graph $G$ is a $2$-dominating set if every vertex of $G$ not in $S$ is adjacent to at least two vertices in $S$, and $S$ is a $2$-independent set if every vertex in $S$ is adjacent to at most one vertex of $S$.…
Tile \(\mathbb{R}^2\) into disjoint unit squares \(\{S_k\}_{k \geq 0}\) with the origin being the centre of \(S_0\) and say that \(S_i\) and \(S_j\) are star adjacent if they share a corner and plus adjacent if they share an edge. Every…
The prism graph is the dual of the complete graph on five vertices with an edge deleted, $K_5\backslash e$. In this paper we determine the class of binary matroids with no prism minor. The motivation for this problem is the 1963 result by…
In this paper, we focus on the study of immanantal polynomials for linear combination matrices composed of the degree matrix and adjacency matrix of a graph. First, applying the concept of vertex orientation for general graphs, we provide a…
In a first part of this paper, we introduce a homology theory for infinity-operads and for dendroidal spaces which extends the usual homology of differential graded operads defined in terms of the bar construction, and we prove some of its…
Applications of tangles of connectivity systems suggest a duality between these, in which for two sets $X$ and $Y\!$ the elements $x$ of $X$ map to subsets $Y_x$ of $Y\!$, and the elements $y$ of $Y\!$ map to subsets $X_y$ of $X$, so that…
We give a simplified definition of topological T-duality that applies to arbitrary torus bundles. The new definition does not involve Chern classes or spectral sequences, only gerbes and morphisms between them. All the familiar topological…
Let p be a singular point of a variety. Consider a resolution where the preimage of p is a simple normal crossing divisor E. The combinatorial structure of E is described by a cell complex D(E), called the dual graph or dual complex of E.…
One of the well-known measurements of vulnerability in graph theory is domination. There are many kinds of dominating and relative types of sets in graphs. However, we are going to focus on Roman domination, which is a type of domination…
We prove canonical and non-canonical tree-of-tangles theorems for abstract separation systems that are merely structurally submodular. Our results imply all known tree-of-tangles theorems for graphs, matroids and abstract separation systems…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
This sequel to our paper (Infinite gammoids, 2014) considers minors and duals of infinite gammoids. We prove that a class of gammoids definable by digraphs not containing a certain type of substructure, called an outgoing comb, is…
Let v(G) and dom(G) denote the number of vertices and the domination number of a graph G, and let r (G) = dom(G)/v(G)$. Let [x] and ]x[ be the floor and the ceiling of a number x. In 1996 B. Reed conjectured that if G is a cubic graph, then…
In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-conditions and look at arbitrary undirected) graphs. This…
The aim of this work is to investigate the nonnegative signed domination number $\gamma^{NN}_s$ with emphasis on regular, ($r+1$)-clique-free graphs and trees. We give lower and upper bounds on $\gamma^{NN}_s$ for regular graphs and prove…
This work addresses the intrinsic relationship between trees and networks (i.e. graphs). A complete (invertible) mapping is presented which allows trees to be mapped into weighted graphs and then backmapped into the original tree without…