Related papers: Factors in infinite groups

A {\it star-factor} of a graph $G$ is a spanning subgraph of $G$ such that each component of which is a star. Recently, Hartnell and Rall studied a family $\mathscr{U}$ of graphs satisfying the property that every star-factor of a member…

We prove that assuming suitable cardinal arithmetic, if B is a Boolean algebra every homomorphic image of which is isomorphic to a factor, then B has locally small density. We also prove that for an (infinite) Boolean algebra B, the number…

A graph is strongly perfect if every induced subgraph H has a stable set that meets every nonempty maximal clique of H. The characterization of strongly perfect graphs by a set of forbidden induced subgraphs is not known. Here we provide…

Let G be a finitely presented group, and let {G_i} be a collection of finite index normal subgroups that is closed under intersections. Then, we prove that at least one of the following must hold: 1. G_i is an amalgamated free product or…

Suppose that $A,B$ are two non-empty subsets of the finite nilpotent group $G$. If $A\not=B$, then the cardinality of the restricted sumset $$A\dotplus B={a+b: a\in A, b\in B, a\neq b} $$ is at least $$\min{p(G),|A|+|B|-2},$$ where $p(G)$…

Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight $1$. In $1994$, Mahadev et al.~introduced a subclass of equistable graphs,…

Answering a question of Benjamini, we present an isometry-invariant random partition of the Euclidean space $\mathbb{R}^d$, $d\geq 3$, into infinite connected indistinguishable pieces, such that the adjacency graph defined on the pieces is…

Let $G$ be a finite simple group. By a theorem of Guralnick and Kantor, $G$ contains a conjugacy class $C$ such that for each non-identity element $x \in G$, there exists $y \in C$ with $G = \langle x,y\rangle$. Building on this deep…

Let $\mathbb{N}$ be a set of the natural numbers. Symmetric inverse semigroup $R_\infty$ is the semigroup of all infinite 0-1 matrices $[g_{ij}]$ with at most one 1 in each row and each column such that $g_{ii}=1$ on the complement of a…

The stability number of a graph G, denoted by alpha(G), is the cardinality of a maximum stable set, and mu(G) is the cardinality of a maximum matching in G. If alpha(G)+mu(G) equals its order, then G is a Konig-Egervary graph. In this paper…

An edge-weighted graph $G=(V,E)$ is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in some interesting game theory problems, such as…

A graph $G$ is $k$-factor-critical if $G-S$ has a perfect matching for any $k$-subset $S$ of the vertex set of $G$. In this paper, we investigate the factor-criticality of graphs with fixed minimum degree and provide sufficient conditions…

Let $G$ be a finite abelian group of order $n$. For any subset $B$ of $G$ with $B=-B$, the Cayley graph $G_B$ is a graph on vertex set $G$ in which $ij$ is an edge if and only if $i-j\in B.$ It was shown by Ben Green that when $G$ is a…

A dominating set in a graph $G$ is a set $S$ of vertices such that every vertex in $V(G) \setminus S$ is adjacent to a vertex in $S$. A restrained dominating set of $G$ is a dominating set $S$ with the additional restraint that the graph $G…

A maximum stable set in a graph G is a stable set of maximum cardinality. S is a local maximum stable set if it is a maximum stable set of the subgraph of G spanned by the union of S and N(S), where N(S) is the neighborhood of S. One…

We study finite groups $G$ with the property that for any subgroup $M$ maximal in $G$ whose order is divisible by all the prime divisors of $|G|$, $M$ is supersolvable. We show that any nonabelian simple group can occur as a composition…

A dominating set in a graph $G$ is a set $S$ of vertices such that every vertex that does not belong to $S$ is adjacent to a vertex in $S$. The domination number $\gamma(G)$ of $G$ is the minimum cardinality of a dominating set of $G$. The…

A graph with at most two vertices of the same degree is called antiregular (Merris 2003), maximally nonregular (Zykov 1990) or quasiperfect (Behzad, Chartrand 1967). If s_{k} is the number of independent sets of cardinality k in a graph G,…

Let for a prime $p$, $\mathfrak{X}$ (respectively $\mathfrak{Y}$) be the class of all $p$-biprimitively finite (respectively periodic $p$-conjugatively biprimitively finite) groups and $G\in \mathfrak{X}$ (respectively $G\in \mathfrak{Y}$),…

Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…