Related papers: Characteristics of graph braid groups

For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…

We consider hereditary classes of graphs equipped with a total order. We provide multiple equivalent characterisations of those classes which have bounded twin-width. In particular, we prove a grid theorem for classes of ordered graphs…

A balanced graph is a bipartite graph with no induced circuit of length 2 mod 4. These graphs arise in linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley…

In an earlier paper, the authors considered three types of graphs, and three equivalence relations, defined on a group, viz.\ the power graph, enhanced power graph, and commuting graph, and the relations of equality, conjugacy, and same…

Magnitude homology is a bigraded homology theory for finite graphs defined by Hepworth and Willerton, categorifying the power series invariant known as magnitude which was introduced by Leinster. We analyze the structure and implications of…

In this note, we prove that every 4-connected optimal 2-planar graph is Hamiltonian-connected. Furthermore, we show that the 4-connectedness condition is sharp by constructing infinitely many 3-connected optimal 2-planar graphs that are…

Let V be the 7-dimensional irreducible representation of the quantum group U_q(g_2). For each n, there is a map from the braid group B_n to the endomorphism algebra of the n-th tensor power of V, given by R-matrices. We can extend this…

We define the class of high dimensional graph manifolds. These are compact smooth manifolds supporting a decomposition into finitely many pieces, each of which is diffeomorphic to the product of a torus with a finite volume hyperbolic…

In this paper, we introduce the notion of 2-boundary planar graphs. A graph is 2-boundary planar if it has an embedding in the plane so that all vertices lie on the boundary of at most two faces and no edges are crossed. A proper coloring…

We formulate a categorification of Robertson's conjecture analogous to the categorical graph minor conjecture of Miyata--Proudfood--Ramos. We show that these conjectures imply the existence of a finite list of atomic graphs generating the…

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

A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…

We show that every edge in a 2-edge-connected planar cubic graph is either contained in a 2-edge-cut or is a chord of some cycle that is contained in a 2-factor of the graph. As a consequence, we show that every edge in a cyclically…

A conjugation-free geometric presentation of a fundamental group is a presentation with the natural topological generators $x_1, ..., x_n$ and the cyclic relations: $x_{i_k}x_{i_{k-1}} ... x_{i_1} = x_{i_{k-1}} ... x_{i_1} x_{i_k} = ... =…

Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…

We characterize those 1-ended word hyperbolic groups whose Gromov boundaries are homeomorphic to trees of graphs (i.e. to inverse limits of graphs that have particularly simple finitary descriptions). These are groups with the simplest…

Building on recent work of Robertson and Steger, we associate a C*-algebra to a combinatorial object which may be thought of as a higher rank graph. This C*-algebra is shown to be isomorphic to that of the associated path groupoid.…

It is proven that a connected graph is planar if and only if all its cocycles with at least four edges are "grounded" in the graph. The notion of grounding of this planarity criterion, which is purely combinatorial, stems from the intuitive…

We present those properties of planar doodles, especially when regarded as 4-valent graphs, that enable us to classify them into {\it prime} and {\it super prime} doodles by analogy to a knot sum. We describe a method for partially…

We prove a homology vanishing theorem for graphs with positive Bakry-\'Emery curvature, analogous to a classic result of Bochner on manifolds \cite{Bochner}. Specifically, we prove that if a graph has positive curvature at every vertex,…