Related papers: Row-finite equivalents exist only for row-countabl…

An edge colouring of a graph is called distinguishing if there is no non-trivial automorphism which preserves it. We prove that every at most countable, finite or infinite, connected regular graph of order at least $7$ admits a…

Let $E$ be a countable directed graph. We show that $C^*(E)$ is AF-embeddable if and only if no loop in $E$ has an entrance. The proof is constructive and is in the same spirit as the Drinen-Tomforde desingularization.

If $E$ is a directed graph and $K$ is a field, the Leavitt path algebra $L_K(E)$ of $E$ over $K$ is naturally graded by the group of integers $\mathbb Z.$ We formulate properties of the graph $E$ which are equivalent with $L_K(E)$ being a…

A meteor graph is a connected graph with no sources and sinks consisting of two disjoint cycles and the paths connecting these cycles. We prove that two meteor graphs are shift equivalent if and only if they are strongly shift equivalent,…

In this paper we completely describe graphically Leavitt path algebras with bounded index of nilpotence. We show that the Leavitt path algebra $L_{K}(E)$ has index of nilpotence at most $n$ if and only if no cycle in the graph $E$ has an…

We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…

We characterize the class of infinite connected graphs $ G $ for which there exists a $ T $-join for any choice of an infinite $ T \subseteq V(G) $. We also show that the following well-known fact remains true in the infinite case. If $ G $…

Given a directed graph E we describe a method for constructing a Leavitt path algebra $L_R(E)$ whose coefficients are in a commutative unital ring R. We prove versions of the Graded Uniqueness Theorem and Cuntz-Krieger Uniqueness Theorem…

There is a tight relation between the geometry of a directed graph and the algebraic structure of a Leavitt path algebra associated to it. In this note, we show a similar connection between the geometry of the graph and the structure of a…

In this paper we address the classification problem for purely infinite simple Leavitt path algebras of finite graphs over a field $\ell$. Each graph $E$ has associated a Leavitt path $\ell$-algebra $L(E)$. There is an open question which…

We introduce and study the Separation Problem for infinite graphs, which involves determining whether a connected graph splits into at least two infinite connected components after the removal of a given finite set of edges. We prove that…

A connected graph $G$, of order two or more, is matching covered if each edge lies in some \pema. The tight cut decomposition of a matching covered graph $G$ yields a list of bricks and braces; as per a theorem of Lov{\'a}sz~\cite{lova87},…

A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…

Simultaneous Geometric Embedding (SGE) asks whether, for a given collection of graphs on the same vertex set V, there is an embedding of V in the plane that admits a crossing-free drawing with straightline edges for each of the given…

For any unital commutative ring $R$ and for any graph $E$, we identify the commutative core of the Leavitt path algebra of $E$ with coefficients in $R$, which is a maximal commutative subalgebra of the Leavitt path algebra. Furthermore, we…

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…

Given a finite, simple, connected graph $G=(V,E)$ with $|V|=n$, we consider the associated graph Laplacian matrix $L = D - A$ with eigenvalues $0 = \lambda_1 < \lambda_2 \leq \dots \leq \lambda_n$. One can also consider the same graph…

We show that if $E$ is an arbitrary acyclic graph then the Leavitt path algebra $L_K(E)$ is locally $K$-matricial; that is, $L_K(E)$ is the direct union of subalgebras, each isomorphic to a finite direct sum of finite matrix rings over the…

Let $G$ be a multigraph with $n$ vertices and $e>4n$ edges, drawn in the plane such that any two parallel edges form a simple closed curve with at least one vertex in its interior and at least one vertex in its exterior. Pach and T\'oth (A…

A group graded $K$-algebra $A=\bigoplus\limits_{g\in G} A_g$ is called "locally finite" if $\dim_K A_g < \infty$ for every $g\in G$. We characterise the weighted graphs $(E,w)$ for which the weighted Leavitt path algebra $L_K(E,w)$ is…