Related papers: Left-Right Pairs and Complex Forests of Infinite R…
Two rooted locally finite trees are considered equivalent if both can be embedded into each other as topological minors by means of tree-order preserving mappings. By exploiting Nash-William's Theorem, Matthiesen provided a non-constructive…
In this article we investigate the application of complex split biquaternions and bioctonions to the standard model. We show that the Clifford algebras Cl(3) and Cl(7) can be used for making left-right symmetric fermions. Hence we…
For graphs F and G an F-matching in G is a subgraph of G consisting of pairwise vertex disjoint copies of F. The number of F-matchings in G is denoted by s(F,G). We show that for every fixed positive integer m and every fixed tree F, the…
Any planar graph has a crossing-free straight-line drawing in the plane. A simultaneous geometric embedding of two n-vertex graphs is a straight-line drawing of both graphs on a common set of n points, such that the edges withing each…
Two of the most prominent unresolved conjectures in graph theory, the Albertson-Berman conjecture and the Matheson-Tarjan conjecture, have been extensively studied by many researchers. (AB) Every planar graph of order $n$ has an induced…
Properties of metrics and pairs consisting of left and right connections are studied on the bimodules of differential 1-forms. Those bimodules are obtained from the derivation based calculus of an algebra of matrix valued functions, and an…
Two elements $a,b$ in a ring $R$ form a right coprime pair, written $\langle a,b\rangle$, if $aR+bR=R$. Right coprime pairs have shown to be quite useful in the study of left cotorsion or exchange rings. In this paper, we define the class…
We systematically develop the multivariable counterpart of the theory of weighted shifts on rooted directed trees. Capitalizing on the theory of product of directed graphs, we introduce and study the notion of multishifts on directed…
We introduce and investigate the approximability of the maximum binary tree problem (MBT) in directed and undirected graphs. The goal in MBT is to find a maximum-sized binary tree in a given graph. MBT is a natural variant of the…
This work concerns a construction of pattern-avoiding inversion sequences from right to left we call the generating tree growing on the left. We first apply this construction to inversion sequences avoiding 201 and 210, resulting in a new…
Quadratic algebras related to some classes of finite left non-degenerate solutions (X,r) of the Yang--Baxter equation have been intensively studied since they are the associative ring-theoretical tool to study solutions. These are the…
We present recursive formulas giving the maximal number of leaves in tree-like polyforms living in two-dimensional regular lattices and in tree-like polycubes in the three-dimensional cubic lattice. We call these tree-like polyforms and…
We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…
In this paper we consider the directed path-width and directed tree-width of recursively defined digraphs. As an important combinatorial tool, we show how the directed path-width and the directed tree-width can be computed for the disjoint…
A compacted binary tree is a graph created from a binary tree such that repeatedly occurring subtrees in the original tree are represented by pointers to existing ones, and hence every subtree is unique. Such representations form a special…
A spanning subgraph $F$ of a graph $G$ is called {\em perfect} if $F$ is a forest, the degree $d_F(x)$ of each vertex $x$ in $F$ is odd, and each tree of $F$ is an induced subgraph of $G$. Alex Scott (Graphs \& Combin., 2001) proved that…
Graph transformation is the rule-based modification of graphs, and is a discipline dating back to the 1970s. The declarative nature of graph rewriting rules comes at a cost. In general, to match the left-hand graph of a fixed rule within a…
For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…
Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits,…
We generalize and reprove an identity of Parker and Loday. It states that certain pairs of generating series associated to pairs of labelled rooted planar trees are mutually inverse under composition.