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

In our main result, we establish that any conical sandpile monoid $M = SP(G)$ of a directed sandpile graph $G$ can be realised as the $\mathcal{V}$-monoid of a weighted Leavitt path algebra $L_K(E,w)$, and consequently, the sandpile group…

We classify row-finite Leavitt path algebras associated to graphs with no more than two vertices. For the discussion we use the following invariants: decomposability, the $K_0$ group, $\det(N'_E)$ (included in the Franks invariants), the…

We prove that, for the edge ideal of a graph whose cycles are pairwise vertex-disjoint, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes.

We define Leavitt path algebras of hypergraphs generalizing simultaneously Leavitt path algebras of finitely separated graphs and Leavitt path algebras of row-finite vertex-weighted graphs. We find linear bases for those algebras, compute…

Let $k \geq 3$ be an integer, $h_{k}(G)$ be the number of vertices of degree at least $2k$ in a graph $G$, and $\ell_{k}(G)$ be the number of vertices of degree at most $2k-2$ in $G$. Dirac and Erd\H{o}s proved in 1963 that if $h_{k}(G) -…

A conjecture by Lichiardopol states that for every $k \ge 1$ there exists an integer $g(k)$ such that every digraph of minimum out-degree at least $g(k)$ contains $k$ vertex-disjoint directed cycles of pairwise distinct lengths. Motivated…

The Graded Classification Conjecture states that for finite directed graphs $E$ and $F$, the associated Leavitt path algebras $L_\K(E)$ and $L_\K(F)$ are graded Morita equivalent, i.e., $\Gr L_\K(E) \approx_{\gr} \Gr L_\K(F)$, if and only…

In this paper we show that every non-cycle finite transitive directed graph has a Cuntz-Krieger family whose WOT-closed algebra is $B(\mathcal{H})$. This is accomplished through a new construction that reduces this problem to in-degree…

We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…

In this paper, we consider a general degree sum condition sufficient to imply the existence of $k$ vertex-disjoint chorded cycles in a graph $G$. Let $\sigma_t(G)$ be the minimum degree sum of $t$ independent vertices of $G$. We prove that…

For a weighted graph $E$, we construct representation graphs $F$, and consequently, $L_K(E)$-modules $V_F$, where $L_K(E)$ is the Leavitt path algebra associated to $E$, with coefficients in a field $K$. We characterise representation…

In a graph G, the cardinality of the smallest ordered set of vertices that distinguishes every element of V (G)[E(G) is called the mixed metric dimension of G. In this paper we first establish the exact value of the mixed metric dimension…

We study the existence of directed Hamilton cycles in random digraphs with $m$ edges where we condition on minimum in- and out-degree $\d \ge k+1$, where $k \ge 1$. Denote such a random graph by $D_{n,m}^{(\delta\geq k+1)}$. Let $m=cn$ and…

Let $k \ge 3$ be an integer, $H_{k}(G)$ be the set of vertices of degree at least $2k$ in a graph $G$, and $L_{k}(G)$ be the set of vertices of degree at most $2k-2$ in $G$. In 1963, Dirac and Erd\H{o}s proved that $G$ contains $k$…

We introduce filtered algebraic $K$-theory of a ring $R$ relative to a sublattice of ideals. This is done in such a way that filtered algebraic $K$-theory of a Leavitt path algebra relative to the graded ideals is parallel to the gauge…

We compute the monoid of isomorphism classes of finitely generated projective modules of a Leavitt path algebra over an arbitrary directed graph. Our result generalizes the result of Ara, Moreno, and Pardo in which they computed this monoid…

The famous K\H{o}nig-Egerv\'ary theorem is equivalent to the statement that the matching number equals the vertex cover number for every induced subgraph of some graph if and only if that graph is bipartite. Inspired by this result, we…

Leavitt path algebras are associated to di(rected )graphs and there is a combinatorial procedure (the reduction algorithm) making the digraph smaller while preserving the Morita type. We can recover the vertices and most of the arrows of…

We devise constant-factor approximation algorithms for finding as many disjoint cycles as possible from a certain family of cycles in a given planar or bounded-genus graph. Here disjoint can mean vertex-disjoint or edge-disjoint, and the…

Let $\Gamma$ be the infinite cyclic group on a generator $x.$ To avoid confusion when working with $\mathbb Z$-modules which also have an additional $\mathbb Z$-action, we consider the $\mathbb Z$-action to be a $\Gamma$-action instead.…