Related papers: Normal binary graph models

A stratified pseudomanifold is normal if its links are connected. A normalization of a stratified pseudomanifold $X$ is a normal stratified pseudomanifold $Y$ together with a finite-to-one projection $n:Y\to X$ satisfying a local condition…

There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…

We study groupoids and semigroup C*-algebras arising from graphs of monoids, in the setting of right LCM monoids. First, we establish a general criterion when a graph of monoids gives rise to a submonoid of the fundamental group which is…

In this paper we present two independent computational proofs that the monoid derived from $5\times 5\times 3$ contingency tables is normal, completing the classification by Hibi and Ohsugi. We show that Vlach's vector disproving normality…

Let $G$ be a connected semisimple algebraic group of adjoint type defined over an algebraically closed field $K$ of positive characteristic. The characteristic $p$ is very good for $G$ when $p$ is suitably large and, if $G$ is of type…

Let G be a finitely generated group and M_n(G) the number of its normal subgroup subgroups of index at most n. For linear groups G we show that M_n(G) can grow polynomially in n only if the semisimple part of the Zariski closure of G has…

We classify all graphs for which the Rees algebras of their edge ideals are normal and have regularity equal to their matching numbers.

In this note, it is proved that a graphs is $(2K_2,P_4)$-free if and only if its edge ring is universally Koszul. Using properties of this family of graphs, we show that Universally Koszul algebras defined by graphs have linear minimal free…

In this paper we investigate the $directed$ $normalizing$ $graph$ associated with a group $G$, defined as the simple directed graph whose vertices are the elements of $G$, with an arrow from $x$ to $y$ whenever the subgroup $\langle x…

In the $\mathcal{F}$-Minor-Free Deletion problem one is given an undirected graph $G$, an integer $k$, and the task is to determine whether there exists a vertex set $S$ of size at most $k$, so that $G-S$ contains no graph from the finite…

We show that the probability for a finitely generated subgroup of the modular group, of size $n$, to be almost malnormal or non-parabolic, tends to 0 as $n$ tends to infinity -- where the notion of the size of a subgroup is based on a…

We give a simple algorithm that enables us to determine whether a subgroup of finite index of the Hecke group is normal.

In a proximity region graph ${\cal G}$ in $\mathbb{R}^d$, two distinct points $x,y$ of a point process $\mu$ are connected when the 'forbidden region' $S(x,y)$ these points determine has empty intersection with $\mu$. The Gabriel graph,…

Sewell and Trotter [J. Combin. Theory Ser. B, 1993] proved that every connected alpha-critical graph that is not isomorphic to K_1, K_2 or an odd cycle contains a totally odd K_4-subdivision. Their theorem implies an interesting min-max…

Let $G$ be a finite group and $N$ a normal subgroup of $G$. We determine the structure of $N$ when the diameter of the graph associated to the $G$-conjugacy classes contained in $N$ is as large as possible, that is, is equal to three.

Regular and distance-regular characterizations of general graphs are well-known. In particular, the spectral excess theorem states that a connected graph G is distance-regular if and only if its spectral excess (a number that can be…

In this paper we explore some results concerning the spread of the line and the total graph of a given graph. In particular, it is proved that for an $(n,m)$ connected graph $G$ with $m > n \geq 4$ the spread of $G$ is less than or equal to…

We discuss a partial normalisation of a finite graph of finite groups $(\Gamma(-), X)$ which leaves invariant the fundamental group. In conjunction with an easy graph-theoretic result, this provides a flexible and rather useful tool in the…

Let G be a group and H be a subgroup of G which is either finite or of finite index in G. In this note, we give some characterizations for normality of H in G. As a consequence we get a very short and elementary proof of the Main Theorem of…

A graph $H$ is said to be common if the number of monochromatic labelled copies of $H$ in a $2$-colouring of the edges of a large complete graph is asymptotically minimized by a random colouring. It is well known that the disjoint union of…