Related papers: Braid graphs in simply-laced triangle-free Coxeter…

The classical Whitney's 2-Isomorphism Theorem describes the families of graphs having the same cycle matroid. In this paper we describe the families of graphs having the same truncated cycle matroid and prove, in particular, that every…

We introduce two common divisor graphs associated with a finite skew brace, based on its $\lambda$- and $\theta$-orbits. We prove that the number of connected components is at most two and the diameter of a connected component is at most…

We prove that even Coxeter groups, whose Coxeter diagrams contain no (4,4,2) triangles, are conjugacy separable. In particular, this applies to all right-angled Coxeter groups or word hyperbolic even Coxeter groups. For an arbitrary Coxeter…

We say that a graph is intrinsically knotted or completely 3-linked if every embedding of the graph into the 3-sphere contains a nontrivial knot or a 3-component link any of whose 2-component sublink is nonsplittable. We show that a graph…

The class of cographs is one of the most well-known graph classes, which is also known to be equivalent to the class of $P_4$-free graphs. We show that Mader's conjecture is true if we restrict ourselves to cographs, that is, for any tree…

Extending Stallings' foldings of trees, we show in this article that every parallel-preserving map between median graphs factors as an isometric embedding through a sequence of elementary transformations which we call foldings and…

An edge in a $k$-connected graph $G$ is called {\em $k$-contractible} if the graph $G/e$ obtained from $G$ by contracting $e$ is $k$-connected. Generalizing earlier results on $3$-contractible edges in spanning trees of $3$-connected…

Let g be a symmetrisable Kac-Moody algebra, and U_h(g) the corresponding quantum group. We showed in arXiv:1610.09744 and arXiv:1610.09741 that the braided quasi-Coxeter structure on integrable, category O representations of U_h(g) which…

A vertex whose removal in a graph $G$ increases the number of components of $G$ is called a cut vertex. For all $n,c$, we determine the maximum number of connected induced subgraphs in a connected graph with order $n$ and $c$ cut vertices,…

There is empirical evidence supporting the claim that almost all cubic non-Hamiltonian graphs are bridge graphs. In this paper, we pose a related conjecture and prove that the original claim holds for non-3-connected graphs if the…

The dominating graph of a graph G is a graph whose vertices correspond to the dominating sets of G and two vertices are adjacent whenever their corresponding dominating sets differ in exactly one vertex. Studying properties of dominating…

A $k$-weak bisection of a cubic graph $G$ is a partition of the vertex-set of $G$ into two parts $V_1$ and $V_2$ of equal size, such that each connected component of the subgraph of $G$ induced by $V_i$ ($i=1,2$) is a tree of at most $k-2$…

Partial cubes are graphs isometrically embeddable into hypercubes. We analyze how isometric cycles in partial cubes behave and derive that every partial cube of girth more than 6 must have vertices of degree less than 3. As a direct…

The based loop space of a configuration space of points in a Euclidean space can be viewed as a space of pure braids in a Euclidean space of one dimension higher. We continue our study of such spaces in terms of Kontsevich's CDGA of…

A middle-cube is an induced subgraph consisting of nodes at the middle two layers of a hypercube. The middle-cubes are related to the well-known Revolving Door (Middle Levels) conjecture. We study the middle-cube graph by completely…

We give a necessary and sufficient condition for a graph to have a right-angled Artin group as its braid group for braid index $\ge 5$. In order to have the necessity part, graphs are organized into small classes so that one of homological…

We show that, for any number of components, the group of braids up to link-homotopy is torsion-free. This generalizes a result of Humphries up to six components, and provides an explicit solution to a question posed by Lin and addressed by…

We establish braided tensor equivalences among module categories over the twisted quantum double of a finite group defined by an extension of a group H by an abelian group, with 3-cocycle inflated from a 3-cocycle on H. We also prove that…

We consider the problem of estimating undirected triangle-free graphs of high dimensional distributions. Triangle-free graphs form a rich graph family which allows arbitrary loopy structures but 3-cliques. For inferential tractability, we…

Let $\Gamma$ be a connected, triangle-free, planar graph with at least five vertices that has no separating vertices or edges. If the graph $\Gamma$ is $\mathcal{CFS}$, we prove that the right-angled Coxeter group $G_\Gamma$ is virtually a…