Related papers: Obstructions to a general characterization of grap…

The literature on word-representable graphs is quite rich, and a number of variations of the original definition have been proposed over the years. We are initiating a systematic study of such variations based on formal languages. In our…

In [36, Section 8], the present author proposed the hypergraph obstruction for the existence of k-regular embeddings. In this paper, we develop the hypergraph obstruction concretely and give some homological obstructions for the k-regular…

We study the automorphism groups of countable homogeneous directed graphs (and some additional homogeneous structures) from the point of view of topological dynamics. We determine precisely which of these automorphism groups are amenable…

In this paper we are interested in the fine-grained complexity of deciding whether there is a homomorphism from an input graph $G$ to a fixed graph $H$ (the $H$-Coloring problem). The starting point is that these problems can be viewed as…

We say that binary relation E on a space X is a clopen graph on X iff E is symmetric and irreflexive and clopen relative to X x X minus its diagonal. Equivalently for distinct x, y in X there are open sets U,V with (x,y) in U x V and either…

In this paper we prove that a graph is a string graph (the intersection graph of curves in the plane) if and only if it admits a drawing in the plane with certain properties. This also allows us to define an algebraic obstruction, similar…

A contact $B_0$-VPG graph is a graph for which there exists a collection of nontrivial pairwise interiorly disjoint horizontal and vertical segments in one-to-one correspondence with its vertex set such that two vertices are adjacent if and…

We shall consider a locally compact groupoid endowed with a Haar system and having proper orbit space. We shall construct a groupoid C*-algebra which is independent of the Haar system (up to a *-isomorphism).

Similarity notions between vertices in a graph, such as structural and regular equivalence, are one of the main ingredients in clustering tools in complex network science. We generalise structural and regular equivalences for undirected…

Let $C_b(X)$ be the C*-algebra of bounded continuous functions on some non-compact, but locally compact Hausdorff space $X$. Moreover, let $A_0$ be some ideal and $A_1$ be some unital C*-subalgebra of $C_b(X)$. For $A_0$ and $A_1$ having…

Digraphs are generalizations of graphs in which each edge is assigned with a direction or two directions. In this paper, we define discrete Morse functions on digraphs, and prove that the homology of the Morse complex and the path homology…

We show that a $C^*$-algebra $\mathfrak{A}$ which is stably isomorphic to a unital graph $C^*$-algebra, is isomorphic to a graph $C^*$-algebra if and only if it admits an approximate unit of projections. As a consequence, a hereditary…

A directed graph is set-homogeneous if, whenever U and V are isomorphic finite subdigraphs, there is an automorphism g of the digraph with U^g=V. Here, extending work of Lachlan on finite homogeneous digraphs, we classify finite…

In this paper we consider the problem of characterization of topological spaces that embed into countably compact Hausdorff spaces. We study the separation axioms of subspaces of countably compact Hausdorff spaces and construct an example…

Continuous mappings between compact Hausdorff spaces can be studied using homomorphisms between algebraic structures (lattices, Boolean algebras) associated with the spaces. This gives us more tools with which to tackle problems about these…

We study the topological persistence of the (path) configuration spaces and the (path) independence complexes for digraphs as well as their underlying graphs. We construct some canonical embeddings from the (path) independence complexes of…

We introduce the 2-sorted counting logic $GC^k$ that expresses properties of hypergraphs. This logic has available k variables to address hyperedges, an unbounded number of variables to address vertices, and atomic formulas E(e,v) to…

The notion of an upward plane graph in graph theory and that of a progressive plane graph (or plane string diagram) in category theory are essentially the same thing. In this paper, we combine the ideas in graph theory and category theory…

In a number of recent papers, (k+l)-graphs have been constructed from k-graphs by inserting new edges in the last l dimensions. These constructions have been motivated by C*-algebraic considerations, so they have not been treated…

A large driver of the complexity of graph learning is the interplay between structure and features. When analyzing the expressivity of graph neural networks, however, existing approaches ignore features in favor of structure, making it…