Related papers: On $k$-Connected $\Gamma$-Extensions of Binary Mat…
Lando framed graph bialgebra is generated by framed graphs modulo 4-term relations. We provide an explicit set of generators of its primitive subspace and a description of the set of relations between the generators. We also define an…
In [W. Mader, Connectivity keeping paths in $k$-connected graphs, J. Graph Theory 65 (2010) 61-69.], Mader conjectured that for every positive integer $k$ and every finite tree $T$ with order $m$, every $k$-connected, finite graph $G$ with…
A graph $G$ is said to be $k$-extendable if every matching of size $k$ in $G$ can be extended to a perfect matching of $G$, where $k$ is a positive integer. We say $G$ is $1$-excludable if for every edge $e$ of $G$, there exists a perfect…
In the Matrix approach to graph transformation we represent simple digraphs and rules with Boolean matrices and vectors, and the rewriting is expressed using Boolean operators only. In previous works, we developed analysis techniques…
We relate matroid connectivity to Tutte-connectivity in an infinite graph. Moreover, we show that the two cycle matroids, the finite-cycle matroid and the cycle matroid, in which also infinite cycles are taken into account, have the same…
Let $M$ be an arbitrary matroid with circuits $\mathcal{C}(M)$. We propose a definition of a derived matroid $\delta M$ that has as its ground set $\mathcal{C}(M)$. Unlike previous attempts of such a definition, our definition applies to…
We characterize those bounded multilinear operators that factor through a Hilbert space in terms of its behavior in finite sequences. This extends a result, essentially due to S. Kwapie\'{n}, from the linear to the multilinear setting. We…
We present in this short note a polynomial graph extension procedure that can be used to improve any graph isomorphism algorithm. This construction propagates new constraints from the isomorphism constraints of the input graphs (denoted by…
\noindent In this paper, we show that for any positive integers $r$, $k$, $\Theta$, and $\Gamma$ such that $k \geq 2$ and $r \geq k + \Gamma$, there exists a connected graph $G$ for which $$\begin{array}{llcr} \omega (G) = \chi (G) = k, &…
Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a widely used form of data representation in data mining and…
It had been known since old times [MO, Da] that there exists a universal finite type invariant ("an expansion") Z^{old} for Knotted Trivalent Graphs (KTGs), and that it can be chosen to intertwine between some of the standard operations on…
A "biased expansion" of a graph is a kind of branched covering graph with additional structure related to combinatorial homotopy of circles. Some but not all biased expansions are constructed from groups ("group expansions"); these include…
Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph $G$ with vertex sets $A$…
In this paper, we address the additivity of $n$-multiplicative isomorphisms and $n$-multiplicative derivations on Gamma rings. We proved that, if $\M$ is a $\Gamma$-ring satisfying the some conditions, then any $n$-multiplicative…
In 2010, Mader [W. Mader, Connectivity keeping paths in $k$-connected graphs, J. Graph Theory 65 (2010) 61-69.] proved that every $k$-connected graph $G$ with minimum degree at least $\lfloor\frac{3k}{2}\rfloor+m-1$ contains a path $P$ of…
We call a class $\mathcal{M}$ of matroids hereditary if it is closed under flats. We denote by $\mathcal{M}^{ext}$ the class of matroids $M$ that is in $\mathcal{M}$, or has an element $e$ such that $M \backslash e$ is in $\mathcal{M}$. We…
In mathematics and computer science, connectivity is one of the basic concepts of matroid theory: it asks for the minimum number of elements which need to be removed to disconnect the remaining nodes from each other. It is closely related…
We investigate the "stratified Ehrhart ring theory" for periodic graphs, which gives an algorithm for determining the growth sequences of periodic graphs. The growth sequence $(s_{\Gamma, x_0, i})_{i \ge 0}$ is defined for a graph $\Gamma$…
A seminal result by Whitney describes when two graphs have the same cycles. We consider the analogous problem for even cycle matroids. A representation of an even cycle matroid is a pair formed by a graph together with a special set of…
We give necessary and sufficient condition so that we have d-hypercyclicity for operators who map a holomorphic function to a partial sum of the Taylor expansion. This problem is connected with doubly universal Taylors series and this is an…