Related papers: Removing sources from higher-rank graphs
If a vertex in a graph can be deleted without affecting distances among the other vertices, we shall say it is distance-redundant. Graphs with all, some or no such vertices are discussed. (The latter class was termed distance-critical by…
In this paper we analyze the structure of C*-algebras associated to ultragraphs, which are generalizations of directed graphs. We characterize the simple ultragraph algebras as well as deduce necessary and sufficient conditions for an…
During his work devoted to Coxeter's friezes, M. Cuntz initiated the study of the notion of $\lambda$-quiddity and raised the problem of the study of this over some subsets of $\mathbb C$. More specifically, $\lambda$-quiddities are the…
To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…
A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance…
Let $E$ be a finite directed graph with no sources or sinks and write $X_E$ for the graph correspondence. We study the $C^*$-algebra $C^*(E,Z):=\mathcal{T}(X_E,Z)/\mathcal{K}$ where $\mathcal{T}(X_E,Z)$ is the $C^*$-algebra generated by…
It is shown that no local periodicity is equivalent to the aperiodicity condition for arbitrary finitely-aligned k-graphs. This allows us to conclude that C*(\Lambda) is simple if and only if \Lambda is cofinal and has no local periodicity.
In this paper we define the notion of monic representation for the $C^*$-algebras of finite higher-rank graphs with no sources, and undertake a comprehensive study of them. Monic representations are the representations that, when restricted…
Given a directed graph $E$ and a labeling $\mathcal{L}$, one forms the labeled graph $C^*$-algebra by taking a weakly left--resolving labeled space $(E, \mathcal{L}, \mathcal{B})$ and considering a universal generating family of partial…
Topological quivers generalize the notion of directed graphs in which the sets of vertices and edges are locally compact (second countable) Hausdorff spaces. Associated to a topological quiver $Q$ is a $C^*$-correspondence, and in turn, a…
Tuza famously conjectured in 1981 that in a graph without k+1 edge-disjoint triangles, it suffices to delete at most 2k edges to obtain a triangle-free graph. The conjecture holds for graphs with small treewidth or small maximum average…
The usual crossed product construction which associates to the homeomorphism $T$ of the locally compact space $X$ the C$^*$-algebra $C^*(X,T)$ is extended to the case of a partial local homeomorphism $T$. For example, the Cuntz-Krieger…
Cuntz algebras $\mathcal{O}_n$, $n>1$, are celebrated examples of a separable infinite simple C*-algebra with a number of fascinating properties. Their K-theory allows an embedding of $\mathcal O_m$ in $\mathcal O_n$ whenever $n-1$ divides…
Hoffmann-Ostenhof's Conjecture states that the edge set of every connected cubic graph can be decomposed into a spanning tree, a matching and a $2$-regular subgraph. In this paper, we show that the conjecture holds for claw-free subcubic…
For cardinals lambda, kappa, theta we consider the class of graphs of cardinality lambda which has no subgraph which is (kappa, theta)-complete bipartite graph. The question is whether in such a class there is a universal one under (weak)…
Given a set of matrices, it is often of interest to determine the algebra they generate. Here we exploit the concept of the Burnside graph of a set of matrices, and show how it may be used to deduce properties of the algebra they generate.…
In this paper we describe a new method of defining C*-algebras from oriented combinatorial data, thereby generalizing the constructions of algebras from directed graphs, higher-rank graphs, and ordered groups. We show that only the most…
I introduce yet another way to associate a C*-algebra to a graph and construct a simple nuclear C*-algebra that has irreducible representations both on a separable and a nonseparable Hilbert space.
For each uniformity $k \geq 3$, we construct $k$-uniform linear hypergraphs $G$ with arbitrarily large maximum degree $\Delta$ whose independence polynomial $Z_G$ has a root $\lambda$ with $\lvert\lambda\rvert = O\left(\frac{\log…
A vertex $v$ of a 2-connected cubic graph $G$ is $\lambda$-matchable if $G$ has a spanning subgraph in which $v$ has degree three whereas every other vertex has degree one, and we let $\lambda(G)$ denote the number of such vertices.…