Related papers: Sandpile groups and spanning trees of directed lin…

A tree $T$ in an edge-colored graph is a \emph{proper tree} if any two adjacent edges of $T$ are colored with different colors. Let $G$ be a graph of order $n$ and $k$ be a fixed integer with $2\leq k\leq n$. For a vertex set $S\subseteq…

A circle graph is an intersection graph of a set of chords of a circle. We describe the unavoidable induced subgraphs of circle graphs with large treewidth. This includes examples that are far from the `usual suspects'. Our results imply…

Graph theory is a branch of mathematics in which pair-wise relations between objects are studied. My PhD thesis, supervised by David R. Wood, introduces and investigates a new family of graphs, called link graphs, that generalises the…

We provide a structural description of, and invariants for, maximum spanning tree-packable graphs, i.e. those graphs G for which the edge connectivity of G is equal to the maximum number of edge-disjoint spanning trees in G. These graphs…

Let $G$ be a finite group and $N(G)$ be the set of its conjugacy class sizes excluding~$1$. Let us define a directed graph $\Gamma(G)$, the set of vertices of this graph is $N(G)$ and the vertices $x$ and $y$ are connected by a directed…

If $E$ is a directed graph and $K$ is a field, the Leavitt path algebra $L_K(E)$ of $E$ over $K$ is naturally graded by the group of integers $\mathbb Z.$ We formulate properties of the graph $E$ which are equivalent with $L_K(E)$ being a…

We introduce $C^*$-algebras associated to directed graphs of groups. In particular, we associate a combinatorial $C^*$-algebra to each row-finite directed graph of groups with no sources, and show that this $C^*$-algebra is Morita…

We give a survey of the theory of surface braid groups and the lower algebraic K-theory of their group rings. We recall several definitions and describe various properties of surface braid groups, such as the existence of torsion,…

We introduce $k$-robust clique complexes, a family of simplicial complexes that generalizes the traditional clique complex. Here, a subset of vertices forms a simplex provided it does not contain an independent set of size $k$. We…

The fundamental group of a directed graph admits a natural sequence of quotient groups called $r$-fundamental groups, and the $r$-fundamental groups can capture properties of a directed graph that the fundamental group cannot capture. The…

The kernel of the natural projection of a graph product of groups onto their direct product is called the Cartesian subgroup of the graph product. This construction generalises commutator subgroups of right-angled Coxeter and Artin groups.…

We define cofinite graphs and cofinite groupoids in a unified way that extends the notion of cofinite groups introduced by Hartley. The common underlying structure of all these objects is that they are directed graphs endowed with a certain…

In this note, we introduce a family of bipartite graphs called path restricted ordered bipartite graphs and present it as an abstract generalization of some well known geometric graphs like unit distance graphs on convex point sets. In the…

We construct a Legendrian version of Envelope theory. A tangential family is a 1-parameter family of rays emanating tangentially from a smooth plane curve. The Legendrian graph of the family is the union of the Legendrian lifts of the…

The \textbf{Co-Prime Order Graph} $\Theta (G)$ of a given finite group is a simple undirected graph whose vertex set is the group $G$ itself, and any two vertexes x,y in $\Theta (G)$ are adjacent if and only if $gcd(o(x),o(y))=1$ or prime.…

We introduce a notion of a girth-regular graph as a $k$-regular graph for which there exists a non-descending sequence $(a_1, a_2, \dots, a_k)$ (called the signature) giving, for every vertex $u$ of the graph, the number of girth cycles the…

Let $G$ be a graph, $S$ be a set of vertices of $G$, and $\lambda(S)$ be the maximum number $\ell$ of pairwise edge-disjoint trees $T_1, T_2,..., T_{\ell}$ in $G$ such that $S\subseteq V(T_i)$ for every $1\leq i\leq \ell$. The generalized…

We explicitly determine the group of isomorphism classes of equivariant line bundles on the non-archimedean Drinfeld upper half plane for $\mathrm{GL}_2(F)$, for its subgroups of matrices whose determinant has even (respectively trivial)…

Graded-division algebras are building blocks in the theory of finite-dimensional associative algebras graded by a group G. If G is abelian, they can be described, using a loop construction, in terms of central simple graded-division…

The simplex graph $S(G)$ of a graph $G$ is defined as the graph whose vertices are the cliques of $G$ (including the empty set), with two vertices being adjacent if, as cliques of $G$, they differ in exactly one vertex. Simplex graphs form…