Related papers: When universal edge-colored directed graph $C^*$-a…
We discuss the question whether the existence of perfect matchings in a cubic graph can be seen from the spectrum of its adjacency matrix. For regular graphs in general and for three edge-disjoint perfect matchings in a cubic graph (that…
Given integers $m\le c$ and an exact $c$-coloring of the edges of a complete countably infinite graph (i.e. a coloring that uses exactly $c$ colors), must there be an infinite subgraph that is exactly $m$-colored? Using the Infinite Ramsey…
It is well-known that an undirected graph has no odd cycle if and only if it is bipartite. A less obvious, but similar result holds for directed graphs: a strongly connected digraph has no odd cycle if and only if it is bipartite. Can this…
We prove that the C*-algebra of a directed graph $E$ is liminal iff the graph satisfies the finiteness condition: if $p$ is an infinite path or a path ending with a sink or an infinite emitter, and if $v$ is any vertex, then there are only…
A graph is k-total colourable if there is an assignment of k different colours to the vertices and edges of the graph such that no two adjacent nor incident elements receive the same colour. The total chromatic number of some direct product…
We give a short proof of a recent theorem of Ionescu which shows that the Cuntz-Pimsner C*-algebra of a certain correspondence associated to a Mauldin-Williams graph is isomorphic to the graph algebra.
Finiteness conditions for $C^*$-algebras like AF-embeddability, quasidiagonality, stable finiteness have been studied by many authors and shown to be equivalent for certain classes of $C^*$-algebras. For example, Schfhauser proves that…
An ultragraph gives rise to a labelled graph with some particular properties. In this paper we describe the algebras associated to such labelled graphs as groupoid algebras. More precisely, we show that the known groupoid algebra…
We introduce a family of $C^*$-correspondences $X_\alpha$ naturally associated to every ordinal graph $\Lambda$. When $\Lambda$ is a directed graph, $X_0$ is isomorphic to the usual $C^*$-correspondence associated to a graph. We show that…
In this paper we generalize the notion of a $k$-graph into (countable) infinite rank. We then define our $C^*$-algebra in a similar way as in $k$-graph $C^*$-algebras. With this construction we are able to find analogues to the Gauge…
The C*-envelope of the limit algebra (or limit space) of a contractive regular system of digraph algebras (or digraph spaces) is shown to be an approximately finite C*-algebra and the direct system for the C*-envelope is determined…
We show that in order to prove that every second countable locally compact groups with exact reduced group C*-algebra is exact in the dynamical sense (i.e. KW-exact) it suffices to show this for totally disconnected groups.
It is now well known that a simple graph $C^*$-algebra $C^*(E)$ of a directed graph $E$ is either AF or purely infinite. In this paper, we address the question of whether this is the case for labeled graph $C^*$-algebras recently introduced…
We define a notion of (one-sided) edge shift spaces associated to ultragraphs. In the finite case our notion coincides with the edge shift space of a graph. In general, we show that our space is metrizable and has a countable basis of…
A $k$-edge-colored graph is a finite, simple graph with edges labeled by numbers $1,\ldots,k$. A function from the vertex set of one $k$-edge-colored graph to another is a homomorphism if the endpoints of any edge are mapped to two…
We give a complete description of which unital graph C*-algebras are semiprojective, and use it to disprove two conjectures by Blackadar. To do so, we perform a detailed analysis of which projections are properly infinite in such…
We show that the graph construction used to prove that a gauge-invariant ideal of a graph C*-algebra is isomorphic to a graph C*-algebra, and also used to prove that a graded ideal of a Leavitt path algebra is isomorphic to a Leavitt path…
To a large class of graphs of groups we associate a C*-algebra universal for generators and relations. We show that this C*-algebra is stably isomorphic to the crossed product induced from the action of the fundamental group of the graph of…
We define a perfect coloring of a graph $G$ as a proper coloring of $G$ such that every connected induced subgraph $H$ of $G$ uses exactly $\omega(H)$ many colors where $\omega(H)$ is the clique number of $H$. A graph is perfectly colorable…
Graph C*-algebras have been celebrated as C*-algebras that can be seen, because many important properties may be determined by looking at the underlying graph. This paper introduces the permutation graph for a permutative endomorphism of a…