Related papers: On the second homology of planar graph braid group…
We investigate which topological spaces can be constructed as topological realisations of higher-rank graphs. We describe equivalence relations on higher-rank graphs for which the quotient is again a higher-rank graph, and show that…
We consider the class F of 2-connected non-planar K_{3,3}-subdivision-free graphs that are embeddable in the projective plane. We show that these graphs admit a unique decomposition as a graph K_5 (the core) where the edges are replaced by…
We consider the derangement graph in which the vertices are permutations of $\{ 1,\ldots, n\}$. Two vertices are joined by an edge if the corresponding permutations differ in every position. The derangement graph is known to be Hamiltonian…
A drawing in the plane ($\mathbb{R}^2$) of a graph $G=(V,E)$ equipped with a function $\gamma: V \rightarrow \mathbb{N}$ is \emph{$x$-bounded} if (i) $x(u) <x(v)$ whenever $\gamma(u)<\gamma(v)$ and (ii) $\gamma(u)\leq\gamma(w)\leq…
Homological stability for sequences of groups is often proved by studying the spectral sequence associated to the action of a typical group in the sequence on a highly-connected simplicial complex whose stabilizers are related to previous…
We present a mathematical framework for describing the topology of configuration spaces for particles on one-connected graphs. In particular, we compute the homology groups over integers for different classes of one-connected graphs. Our…
The periodic discrete Toda equation defined over finite fields has been studied. We obtained the finite graph structures constructed by the network of states where edges denote possible time evolutions. We simplify the graphs by introducing…
A graph $X$ is said to be unstable if the direct product $X\times K_2$ (also called the canonical double cover of $X$) has automorphisms that do not come from automorphisms of its factors $X$ and $K_2$. It is non-trivially unstable if it is…
We construct several families of embeddings of braid groups into mapping class groups of orientable and non-orientable surfaces and prove that they induce the trivial map in stable homology in the orientable case, but not so in the…
An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we…
In this article we study higher homological properties of $n$-levelled algebras and connect them to properties of the underlying graphs. Notably, to each $2$-representation-finite quadratic monomial algebra $\Lambda$ we associate a…
The existence of Hamiltonian cycles in 1-planar graphs with higher connectivity has attracted considerable attention. Recently, the authors and Dong proved that 4-connected 1-planar chordal graphs are Hamiltonian-connected. In this paper,…
We study "positive" graphs that have a nonnegative homomorphism number into every edge-weighted graph (where the edgeweights may be negative). We conjecture that all positive graphs can be obtained by taking two copies of an arbitrary…
We introduce the concept of alternate-edge-colourings for maps, and study highly symmetric examples of such maps. Edge-biregular maps of type $(k,l)$ occur as smooth normal quotients of a particular index two subgroup of $T_{k,l}$, the full…
The homology groups of the automorphism group of a free group are known to stabilize as the number of generators of the free group goes to infinity, and this paper relativizes this result to a family of groups that can be defined in terms…
A graph is 1-planar if it can be drawn on a plane so that each edge is crossed by at most one other edge. In this paper, we first give a useful structural theorem for 1-planar graphs, and then apply it to the list edge and list total…
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…
We follow up on previous work which found that commonly used graph evolution moves lead to conserved quantities that can be expressed in terms of the braiding of the graph in its embedding space. We study non-embedded graphs under three…
Classification of planar unit-distance graphs with up to 9 edges, by homeomorphism and isomorphism classes. With exactly nine edges, there are 633 nonisomorphic connected matchstick graphs, of which 196 are topologically distinct from each…