Related papers: Ionescu's theorem for higher rank graphs
We introduce a new family of higher-rank graphs, whose construction was inspired by the graphical techniques of Lambek \cite{Lambek} and Johnstone \cite{Johnstone} used for monoid and category emedding results. We show that they are planar…
It has been proved by Bergh and Thaule that the higher mapping cone axiom is equivalent to the higher octahedral axiom for n-angulated categories. In this note, we use homotopy cartesian diagrams to give several new equivalent statements of…
In this paper, we show that any Coxeter graph which defines a higher rank Coxeter group must have disjoint induced subgraphs each of which defines a hyperbolic or higher rank Coxeter group. We then use this result to demonstrate several…
In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…
Higher-rank graphs are, as the name suggests, higher-dimensional analogues of directed graphs which we will define using category theory. The whole idea of my project was to construct what we call a Baumslag-Solitar graph, a higher-rank…
We give two generalizations of Kac's Theorem on representations of quivers. One is to representations of equipped graphs by relations, in the sense of Gelfand and Ponomarev. The other is to representations of quivers in which certain of the…
Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…
Given a row-finite $k$-graph $\Lambda$ with no sources we investigate the $K$-theory of the higher rank graph $C^*$-algebra, $C^*(\Lambda)$. When $k=2$ we are able to give explicit formulae to calculate the $K$-groups of $C^*(\Lambda)$. The…
!-graphs provide a means of reasoning about infinite families of string diagrams and have proven useful in manipulation of (co)algebraic structures like Hopf algebras, Frobenius algebras, and compositions thereof. However, they have…
We consider various regular graphs defined on the set of elements of given rank of a finite polar space. It is likely that no two such graphs, of the same kind but defined for different ranks, can have the same degree. We shall prove this…
Graph product structure theory expresses certain graphs as subgraphs of the strong product of much simpler graphs. In particular, an elegant formulation for the corresponding structural theorems involves the strong product of a path and of…
In this paper, we give a new class of reconstructible graphs, which is an extension of my paper `A class of reconstructible graphs'.
We introduce a homology theory for k-graphs and explore its fundamental properties. We establish connections with algebraic topology by showing that the homology of a k-graph coincides with the homology of its topological realisation as…
We demonstrate that graph-based models are fully capable of representing higher-order interactions, and have a long history of being used for precisely this purpose. This stands in contrast to a common claim in the recent literature on…
In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…
We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject…
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…
Let R be an equivalence relation on graphs. By the strengthening of R we mean the relation R' such that graphs G and H are in the relation R' if for every graph F, the union of the graphs G and F is in the relation R with the union of the…
We study topological properties of the graph topology.
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…