Related papers: Graphs with disjoint cycles, classification via th…

We show that any pointed, preordered module map $\mathfrak{BF}_{\mathrm{gr}}(E) \to \mathfrak{BF}_{\mathrm{gr}}(F)$ between Bowen-Franks modules of finite graphs can be lifted to a unital, graded, diagonal preserving $\ast$-homomorphism…

We show how to adjust a very nice coupling argument due to McDiarmid in order to prove/reprove in a novel way results concerning Hamilton cycles in various models of random graph and hypergraphs. In particular, we firstly show that for…

It is well-known that the Lie algebra of homotopy non-trivial degree zero derivations of the properad of strongly homotopy Lie bialgebras $\mathcal{H}olieb$ can be identified with the Grothendieck-Teichmuller Lie algebra $\mathfrak{grt}$.…

For all integers $k$ with $k\geq 2$, if $G$ is a balanced $k$-partite graph on $n\geq 3$ vertices with minimum degree at least \[…

Given a connected graph $G(V, E)$, the edge dimension, denoted $\mathrm{edim}(G)$, is the least size of a set $S \subseteq V$ that distinguishes every pair of edges of $G$, in the sense that the edges have pairwise distinct tuples of…

Let G be a plane graph and T an even subset of its vertices. It has been conjectured that if all T-cuts of G have the same parity and the size of every T-cut is at least k, then G contains k edge-disjoint T-joins. The case k=3 is equivalent…

For a graph $G$, let $\sigma_{2}(G)$ be the minimum degree sum of two non-adjacent vertices in $G$. A chord of a cycle in a graph $G$ is an edge of $G$ joining two non-consecutive vertices of the cycle. In this paper, we prove the following…

Let $k$ be a positive integer. Bermond and Thomassen conjectured in 1981 that every digraph with minimum outdegree at least $2k-1$ contains $k$ vertex-disjoint cycles. It is famous as one of the one hundred unsolved problems selected in…

Hecke-Kiselman algebras $A_{\Theta}$, over a field $k$, associated to finite oriented graphs $\Theta$ are considered. It has been known that every such algebra is an automaton algebra in the sense of Ufranovskii. In particular, its…

We say that a (di)graph $G$ has a perfect $H$-packing if there exists a set of vertex-disjoint copies of $H$ which cover all the vertices in $G$. The seminal Hajnal--Szemer\'edi theorem characterises the minimum degree that ensures a graph…

For any field K and directed graph E, we completely describe the elements of the Leavitt path algebra L_K(E) which lie in the commutator subspace [L_K(E),L_K(E)]. We then use this result to classify all Leavitt path algebras L_K(E) that…

We say that a $k$-uniform hypergraph $C$ is a Hamilton cycle of type $\ell$, for some $1\le \ell \le k$, if there exists a cyclic ordering of the vertices of $C$ such that every edge consists of $k$ consecutive vertices and for every pair…

Given an arbitrary graph E and a field K, the prime ideals as well as the primitive ideals of the Leavitt path algebra L_K(E) are completely described in terms of their generators. The stratification of the prime spectrum of L_K(E) is…

Liu and Ma [J. Combin. Theory Ser. B, 2018] conjectured that every $2$-connected non-bipartite graph with minimum degree at least $k+1$ contains $\lceil k/2\rceil $ cycles with consecutive odd lengths. In particular, they showed that this…

Birmele [J. Graph Theory, 2003] proved that every graph with circumference t has treewidth at most t-1. Under the additional assumption of 2-connectivity, such graphs have bounded pathwidth, which is a qualitatively stronger result.…

We show that any graph that contains k edge-disjoint double rays for any k>0 contains also infinitely many edge-disjoint double rays. This was conjectured by Andreae in 1981.

Let $G$ be a graph with edge set $E(G)$. Denote by $d_w$ the degree of a vertex $w$ of $G$. The sigma index of $G$ is defined as $\sum_{uv\in E(G)}(d_u-d_v)^2$. A connected graph of order $n$ and size $n+k-1$ is known as a connected…

Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…

Hazrat gave a K-theoretic invariant for Leavitt path algebras as graded algebras. Hazrat conjectured that this invariant classifies Leavitt path algebras up to graded isomorphism, and proved the conjecture in some cases. In this paper, we…

Tuza [1992] proved that a graph with no cycles of length congruent to $1$ modulo $k$ is $k$-colorable. We prove that if a graph $G$ has an edge $e$ such that $G-e$ is $k$-colorable and $G$ is not, then for $2\leq r\leq k$, the edge $e$ lies…