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

Various authors have been generalizing some unital ring properties to nonunital rings. We consider properties related to cancellation of modules (being unit-regular, having stable range one, being directly finite, exchange, or clean) and…

Let E be an arbitrary directed graph and let K be any field. It is shown that the Leavitt path algebra A of the graph E over the field K is a Zorn ring if and only if the graph E satisfies the Condition (L), that is, every cycle in E has an…

Let $F$ be a connected graph with $\ell$ vertices. The existence of a subgraph isomorphic to $F$ can be defined in first-order logic with quantifier depth no better than $\ell$, simply because no first-order formula of smaller quantifier…

Given an arbitrary graph $E$ we investigate the relationship between $E$ and the groupoid $G_E$. We show that there is a lattice isomorphism between the lattice of pairs $(H, S)$, where $H$ is a hereditary and saturated set of vertices and…

The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…

When the theory of Leavitt path algebras was already quite advanced, it was discovered that some of the more difficult questions were susceptible to a new approach using topological groupoids. The main result that makes this possible is…

Let $E$ be an arbitrary directed graph and let $L$ be the Leavitt path algebra of the graph $E$ over a field $K$. It is shown that every ideal of $L$ is an intersection of primitive/prime ideals in $L$ if and only if the graph $E$ satisfies…

Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrary planar graph to index the decomposition. We prove that…

Richter and Thomassen proved that every graph has an edge $e$ such that the crossing number $\ucr(G-e)$ of $G-e$ is at least $(2/5)\ucr(G) - O(1)$. Fox and Cs. T\'oth proved that dense graphs have large sets of edges (proportional in the…

We construct a countable planar graph which, for any two vertices $u,v$ and any integer $k\ge 1$, contains $k$ edge-disjoint order-compatible $u$--$v$ paths but not infinitely many. This graph has applications in Ramsey theory, in the study…

We introduce a graded homology theory for graded \'etale groupoids. For $\mathbb Z$-graded groupoids, we establish an exact sequence relating the graded zeroth-homology to non-graded one. Specialising to the arbitrary graph groupoids, we…

We obtain necessary and sufficient conditions for pure infiniteness of the path groupoid $C^*$-algebra of a row-finite graph without sinks. In particular we show that for such a path groupoid $\mathcal{G}_E$, the properties of being…

For a nondegenerate $r$-graph $F$, large $n$, and $t$ in the regime $[0, c_{F} n]$, where $c_F>0$ is a constant depending only on $F$, we present a general approach for determining the maximum number of edges in an $n$-vertex $r$-graph that…

Let $\mathcal{F}=\{F_{\alpha}: \alpha\in \mathcal{A}\}$ be a family of infinite graphs, together with $\Lambda$. The Factorization Problem $FP(\mathcal{F}, \Lambda)$ asks whether $\mathcal{F}$ can be realized as a factorization of…

In this paper, we study the Graded Invariant Basis Number (grIBN) property for Leavitt path algebras of finite graphs. Using the talented monoid as our main tool, we establish a complete matrix-theoretic characterization of when a Leavitt…

A vertex with neighbours of degrees $d_1 \geq ... \geq d_r$ has {\em vertex type} $(d_1, ..., d_r)$. A graph is {\em vertex-oblique} if each vertex has a distinct vertex-type. While no graph can have distinct degrees, Schreyer, Walther and…

We show that every graded ideal of a Leavitt path algebra is graded isomorphic to a Leavitt path algebra. It is known that a graded ideal $I$ of a Leavitt path algebra is isomorphic to the Leavitt path algebra of a graph, known as the…

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…

We leverage an algorithm of Deming [R.W. Deming, Independence numbers of graphs -- an extension of the Koenig-Egervary theorem, Discrete Math., 27(1979), no. 1, 23--33; MR534950] to decompose a matchable graph into subgraphs with a precise…

Graph monoids arise naturally in the study of non-stable K-theory of graph C*-algebras and Leavitt path algebras. They play also an important role in the current approaches to the realization problem for von Neumann regular rings. In this…