Related papers: Virtually fibering random right-angled Coxeter gro…

We prove that a finitely generated, right-angled, hyperbolic Coxeter group can be quasiisometrically embedded into the product of n binary trees, where n is the chromatic number of the group. As application we obtain certain strongly…

We give a bound for the virtually cyclic dimension of groups with a normal subgroup of finite index which satisfies that every infinite virtually-cyclic subgroup is contained in a unique maximal such subgroup. As an application we provide a…

We characterize relatively norm compact sets in the regular $C^*$-algebra of finitely generated Coxeter groups using a geometrically defined positive semigroup acting on the algebra.

Consider the random subgraph process on a base graph $G$ on $n$ vertices: a sequence $\lbrace G_t \rbrace _{t=0} ^{|E(G)|}$ of random subgraphs of $G$ obtained by choosing an ordering of the edges of $G$ uniformly at random, and by…

For an integer $k$ at least $2$, and a graph $G$, let $f_k(G)$ be the minimum cardinality of a set $X$ of vertices of $G$ such that $G-X$ has either $k$ vertices of maximum degree or order less than $k$. Caro and Yuster (Discrete…

The Hecke algebra $\mathbb{C}_q[W]$ of a Coxter group $W$, associated to parameter $q$, can be completed to a von Neumann algebra $\mathcal{N}_q(W)$. We study such algebras in case where $W$ is right-angled. We determine the range of $q$…

An n-vertex graph is called C-Ramsey if it has no clique or independent set of size C log n. All known constructions of Ramsey graphs involve randomness in an essential way, and there is an ongoing line of research towards showing that in…

For arbitrary integer n, we describe a large class of right-angled Coxeter systems for which the visual baundary (of the corresponding Coxeter-Davis complex) is homeomorphic to the n-dimensional Sierpi\'nski compactum. We also provide a…

The author, and independently De Concini, conjectured that the monodromy of the Casimir connection of a simple Lie algebra g is described by the quantum Weyl group operators of the quantum group U_h(g). The aim of this paper, and of its…

Let C be a coalgebra and consider the Grothendieck groups of the categories of the socle-finite injective right and left C-comodules. One of the main aims of the paper is to study Coxeter transformation, and its dual, of a pointed sharp…

Cut vertices are often used as a measure of nodes' importance within a network. They are those nodes whose failure disconnects a graph. Let N(G) be the number of connected induced subgraphs of a graph $G$. In this work, we investigate the…

If S and S' are two finite sets of Coxeter generators for a right-angled Coxeter group W, then the Coxeter systems (W,S) and (W,S') are equivalent.

Let $G$ be an infinite discrete group and let $\underline{E}G$ be a classifying space for proper actions of $G$. Every $G$-equivariant vector bundle over $\underline{E}G$ gives rise to a compatible collection of representations of the…

A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, every edge-length preserving continuous motion of the vertices preserves the distances between all pairs of non-adjacent vertices as well.…

For a family $\mathcal{F}$ of graphs, a graph $G$ is called \emph{$\mathcal{F}$-universal} if $G$ contains every graph in $\mathcal{F}$ as a subgraph. Let $\mathcal{F}_n(d)$ be the family of all graphs on $n$ vertices with maximum degree at…

The relative Cayley graph of a group $G$ with respect to its proper subgroup $H$, is a graph whose vertices are elements of $G$ and two vertices $h\in H$ and $g\in G$ are adjacent if $g=hc$ for some $c\in C$, where $C$ is an inversed-closed…

A graph $G$ is called universal for a family of graphs $\mathcal{F}$ if it contains every element $F \in \mathcal{F}$ as a subgraph. Let $\mathcal{F}(n,2)$ be the family of all graphs with maximum degree $2$. Ferber, Kronenberg, and Luh…

For a graph $G$, let $c_k(G)$ be the number of spanning trees of $G$ with maximum degree at most $k$. For $k \ge 3$, it is proved that every connected $n$-vertex $r$-regular graph $G$ with $r \ge \frac{n}{k+1}$ satisfies $$ c_k(G)^{1/n} \ge…

We describe an algorithm to find the virtual cohomological dimension of the automorphism group of a right-angled Artin group. The algorithm works in the relative setting; in particular it also applies to untwisted automorphism groups and…

In vertex-cut sparsification, given a graph $G=(V,E)$ with a terminal set $T\subseteq V$, we wish to construct a graph $G'=(V',E')$ with $T\subseteq V'$, such that for every two sets of terminals $A,B\subseteq T$, the size of a minimum…