Related papers: A Reduction theorem for the $W$-graph decompositio…

Let $W$ be a right-angled Coxeter group corresponding to a finite non-discrete graph $\mathcal{G}$ with at least $3$ vertices. Our main theorem says that $\mathcal{G}^c$ is connected if and only if for any infinite index quasiconvex…

We prove a robust contraction decomposition theorem for $H$-minor-free graphs, which states that given an $H$-minor-free graph $G$ and an integer $p$, one can partition in polynomial time the vertices of $G$ into $p$ sets $Z_1,\dots,Z_p$…

Inspired by the work of Wang and Zhou [4] for Rota-Baxter algebras, we develop a cohomology theory of Rota-Baxter systems and justify it by interpreting the lower degree cohomology groups as formal deformations and as abelian extensions of…

In our previous paper math.QA/0409261, we defined a deformation of the group algebra of the group of even elements of a Coxeter group W, and showed that it is flat for all values of parameters if and only if all the rank 3 parabolic…

In this third part, we make the following hypothesis: representation $R=R(\alpha,\beta,\gamma ;l)$ of $W(p,q,r)$ is reducible and there exist a $G$-invariant non-nulle bilinear form where $G=Im R$. With those conditions, we know the…

Using the geometry of the associated Calogero-Moser space, R. Rouquier and the author have attached to any finite complex reflection group $W$ several notions (Calogero-Moser left, right or two-sided cells, Calogero-Moser cellular…

We study some versions of the statement of Hadwiger's conjecture for finite as well as infinite graphs.

The principal objects studied in this note are Coxeter groups $W$ that are neither finite nor affine. A well known result of de la Harpe asserts that such groups have exponential growth. We consider quotients of $W$ by its parabolic…

Under the assumption that a defining graph of a Coxeter group admits only twists in $\mathbb{Z}_2$ and is of type FC, we prove M\"uhlherr's Twist Conjecture.

We investigate the representations and the structure of Hecke algebras associated to certain finite complex reflection groups. We first describe computational methods for the construction of irreducible representations of these algebras,…

Let us say that a graph $G$ is Ramsey for a tuple $(H_1,\dots,H_r)$ of graphs if every $r$-coloring of the edges of $G$ contains a monochromatic copy of $H_i$ in color $i$, for some $i \in [r]$. A famous conjecture of Kohayakawa and…

We consider the question of determining whether a given group (especially one generated by involutions) is a right-angled Coxeter group. We describe a group invariant, the involution graph, and we characterize the involution graphs of…

The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…

A graph $G$ is said to be Ramsey for a tuple of graphs $(H_1,\dots,H_r)$ if every $r$-coloring of the edges of $G$ contains a monochromatic copy of $H_i$ in color $i$, for some $i$. A fundamental question at the intersection of Ramsey…

We prove the following version of the Loebl-Komlos-Sos Conjecture: For every alpha>0 there exists a number M such that for every k>M every n-vertex graph G with at least (0.5+alpha)n vertices of degree at least (1+alpha)k contains each tree…

We present a proof of a generalization of the theorem of H.~Matsumoto on Coxeter groups. Our generalized version is applicable to "graphs admitting geometric realization". The original version of the theorem for Coxeter groups is a special…

This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for strongly tree-decomposable graphs may be extended to a broader…

We solve the following problem: Can an undirected weighted graph G be parti- tioned into two non-empty induced subgraphs satisfying minimum constraints for the sum of edge weights at vertices of each subgraph? We show that this is possible…

The inertia of a graph $G$ is $\operatorname{In}(G)=(n^+(G),n^0(G),n^-(G))$, where $n^+(G),\, n^0(G),\, n^-(G)$ are the numbers of positive, zero and negative eigenvalues of the adjacency matrix of $G$, respectively, counted with…

In 2004, Karo\'nski, \L uczak and Thomason proposed $1$-$2$-$3$-conjecture: For every nice graph $G$ there is an edge weighting function $ w:E(G)\rightarrow\{1,2,3\} $ such that the induced vertex coloring is proper. After that, the total…