We construct small cancellation labellings for some infinite sequences of finite graphs of bounded degree. We use them to define infinite graphical small cancellation presentations of groups. This technique allows us to provide examples of groups with exotic properties: • We construct the first examples of finitely generated coarsely non-amenable groups (that is, groups without Guoliang Yu’s Property A) that are coarsely embeddable into a Hilbert space. Moreover, our groups act properly on CAT(0) cubical complexes. • We construct the first examples of finitely generated groups, with expanders embedded isometrically into their Cayley graphs—in contrast, in the case of the Gromov monster expanders are not even coarsely embedded. We present further applications.

Geometric genus is an important invariant in the classification theory for isolated singularities. In this paper we give a complete classification of three-dimensional isolated weighted homogeneous singularities with geometric genus one. This is one of important classes of minimally elliptic singularities.

The set of all non-increasing nonnegative integers sequence $\pi=$ ($d(v_1 ),$ $d(v_2 ),$ $...,$ $d(v_n )$) is denoted by $NS_n$. A sequence $\pi\in NS_n$ is said to be graphic if it is the degree sequence of a simple graph $G$ on $n$ vertices, and such a graph $G$ is called a realization of $\pi$. The set of all graphic sequences in $NS_n$ is denoted by $GS_n$. A graphical sequence $\pi$ is potentially $H$-graphical if there is a realization of $\pi$ containing $H$ as a subgraph, while $\pi$ is forcibly $H$-graphical if every realization of $\pi$ contains $H$ as a subgraph. Let $K_k$ denote a complete graph on $k$ vertices. Let $K_{m}-H$ be the graph obtained from $K_{m}$ by removing the edges set $E(H)$ of the graph $H$ ($H$ is a subgraph of $K_{m}$). This paper summarizes briefly some recent results on potentially $K_{m}-G$-graphic sequences and give a useful classification for determining $\sigma(H,n)$.

No abstract uploaded!

Let $K_{m}-H$ be the graph obtained from $K_{m}$ by removing the edges set $E(H)$ of the graph $H$ ($H$ is a subgraph of $K_{m}$). We use the symbol $Z_4$ to denote $K_4-P_2.$ A sequence $S$ is potentially $K_{m}-H$-graphical if it has a realization containing a $K_{m}-H$ as a subgraph. Let $\sigma(K_{m}-H, n)$ denote the smallest degree sum such that every $n$-term graphical sequence $S$ with $\sigma(S)\geq \sigma(K_{m}-H, n)$ is potentially $K_{m}-H$-graphical. In this paper, we determine the values of $\sigma (K_{r+1}-U, n)$ for $n\geq 5r+18, r+1 \geq k \geq 7,$ $j \geq 6$ where $U$ is a graph on $k$ vertices and $j$ edges which contains a graph $K_3 \bigcup P_3$ but not contains a cycle on $4$ vertices and not contains $Z_4$.