Related papers: Obstructions to a general characterization of grap…

We define a bicategory with \'etale, locally compact groupoids as objects and suitable correspondences, that is, spaces with two commuting actions as arrows; the 2-arrows are injective, equivariant continuous maps. We prove that the usual…

We introduce regular closed subgraphs of Katsura's topological graphs and use them to generalize the notion of an adjunction space from topology. Our construction attaches a topological graph onto another via a regular factor map. We prove…

We show that the Hilbert bimodule associated to a compact topological graph can be recovered from the C*-algebraic triple consisting of the Toeplitz algebra of the graph, its gauge action and the commutative subalgebra of functions on the…

This paper explores the effect of various graphical constructions upon the associated graph $C^*$-algebras. The graphical constructions in question arise naturally in the study of flow equivalence for topological Markov chains. We prove…

A fundamental result in the study of graph homomorphisms is Lov\'asz's theorem that two graphs are isomorphic if and only if they admit the same number of homomorphisms from every graph. A line of work extending Lov\'asz's result to more…

For a closed subgroup of a locally compact group the Rieffel induction process gives rise to a $C^*$-correspondence over the $C^*$-algebra of the subgroup. We study the associated Cuntz-Pimsner algebra and show that, by varying the subgroup…

An inaccessible, vertex transitive, locally finite graph is described. This graph is not quasi-isometric to a Cayley graph.

A first-order expansion of the $\mathbb{R}$-vector space structure on $\mathbb{R}$ does not define every compact subset of every $\mathbb{R}^n$ if and only if topological and Hausdorff dimension coincide on all closed definable sets.…

Let $G$ be a graph on $n$ vertices with adjacency matrix $A$, and let $\mathbf{1}$ be the all-ones vector. We call $G$ controllable if the set of vectors $\mathbf{1}, A\mathbf{1}, \dots, A^{n-1}\mathbf{1}$ spans the whole space…

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if, and only if, they are homomorphism indistinguishable over all graphs, i.e., $G$ and $H$ admit the same number of number of homomorphisms from every graph $F$.…

An intersection digraph is a digraph where every vertex $v$ is represented by an ordered pair $(S_v, T_v)$ of sets such that there is an edge from $v$ to $w$ if and only if $S_v$ and $T_w$ intersect. An intersection digraph is reflexive if…

To every directed graph $E$ one can associate a \emph{graph inverse semigroup} $G(E)$, where elements roughly correspond to possible paths in $E$. These semigroups generalize polycylic monoids, and they arise in the study of Leavitt path…

Naimark's problem asks whether a C*-algebra that has only one irreducible *-representation up to unitary equivalence is isomorphic to the C*-algebra of compact operators on some (not necessarily separable) Hilbert space. This problem has…

We establish logical equivalence between statements involving * the Cuntz C*-algebra $\mathcal O_\infty$ with its canonical diagonal; * graph C*-algebras with their canonical diagonals; * Leavitt path algebras over general fields with their…

Let $\mathcal C$ be a subcategory of the category of topologized semigroups and their partial continuous homomorphisms. An object $X$ of the category ${\mathcal C}$ is called ${\mathcal C}$-closed if for each morphism $f:X\to Y$ of the…

A graph $G$ is a $B_0$-VPG graph if one can associate a path on a rectangular grid with each vertex such that two vertices are adjacent if and only if the corresponding paths intersect at at least one grid-point. A graph $G$ is a contact…

The problem of characterizing normed ordered spaces which admit a representation in the algebraic, order and norm sense as a subspace of $C(X)$, the space of all continuous functions on a compact Hausdorff space is a classical problem that…

We introduce a taxonomy of interaction types and show that graphs are focal hypergraphs: every graph is canonically a focal hypergraph via its closed neighbourhood structure, and every graph dynamical model is a special case of the general…

We study the complexity of the Graph Isomorphism problem on graph classes that are characterized by a finite number of forbidden induced subgraphs, focusing mostly on the case of two forbidden subgraphs. We show hardness results and develop…