相关论文: Can groupwise density be much bigger than the non-…

A minimal permutation representation of a finite group G is a faithful G-set with the smallest possible size. We study the structure of such representations and show that for certain groups they may be obtained by a greedy construction. In…

Let L be a Lie group and Lambda a lattice in L. Suppose G is a non-compact simple Lie group realized as a Lie subgroup of L, and the image of G on L/Lambda is dense. Let c be a diagonalizable element of G not contained in a compact…

A 2-covering for a finite group $G$ is a set of proper subgroups of $G$ such that every pair of elements of $G$ is contained in at least one subgroup in the set. The minimal number of subgroups needed to 2-cover a group $G$ is called the…

Let $A$ be a finite subset of an arbitrary additive group $G$, and let $\phi(A)$ denote the cardinality of the largest subset $B$ in $A$ that is sum-avoiding in $A$ (that is to say, $b_1+b_2 \not \in A$ for all distinct $b_1,b_2 \in B$).…

A vertex set $S$ of a graph $G$ is a \emph{dominating set} if each vertex of $G$ either belongs to $S$ or is adjacent to a vertex in $S$. The \emph{domination number} $\gamma(G)$ of $G$ is the minimum cardinality of $S$ as $S$ varies over…

The bondage number $b(G)$ of a nonempty graph $G$ is the cardinality of a smallest set of edges whose removal from $G$ results in a graph with domination number greater than the domination number of $G$. Here we study the bondage number of…

Let "ex" be the cardinality of the smallest independent family of subsets of omega (independent means that all nontrivial Boolean combinations are infinite) which cannot be extended to a homogeneous independent family. "Homogeneous" means…

For an integer $k \ge 1$, a (distance) $k$-dominating set of a connected graph $G$ is a set $S$ of vertices of $G$ such that every vertex of $V(G) \setminus S$ is at distance at most~$k$ from some vertex of $S$. The $k$-domination number,…

Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to minimum cardinality of total…

We propose the conjecture that the domination number $\gamma(G)$ of a $\Delta$-regular graph $G$ with $\Delta\geq 1$ is always at most its edge domination number $\gamma_e(G)$, which coincides with the domination number of its line graph.…

It is proven that if $G$ is a finite group, then $G^\omega$ has $2^{\mathfrak c}$ dense nonmeasurable subgroups. Also, other examples of compact groups with dense nonmeasurable subgroups are presented.

Given a graph $G=(V(G), E(G))$, the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph $G$ are denoted by $\gamma(G)$, $\gamma_{\rm pr}(G)$, and $\gamma_{t}(G)$, respectively. For…

A dominating set in a graph $G$ is a subset of vertices $D$ such that every vertex in $V\setminus D$ is a neighbor of some vertex of $D$. The domination number of $G$ is the minimum size of a dominating set of $G$ and it is denoted by…

Given a finite group $G$, we say that $G$ has weak normal covering number $\gamma_w(G)$ if $\gamma_w(G)$ is the smallest integer with $G$ admitting proper subgroups $H_1,\ldots,H_{\gamma_w(G)}$ such that each element of $G$ has a conjugate…

We prove that a sumset of a TE subset of (\N) (these sets can be viewed as "aperiodic" sets) with a set of positive upper density intersects a set of values of any polynomial with integer coefficients., i.e. for any (A \subset \N ) a TE…

The modular product $G\diamond H$ of graphs $G$ and $H$ is a graph on vertex set $V(G)\times V(H)$. Two vertices $(g,h)$ and $(g^{\prime},h^{\prime})$ of $G\diamond H$ are adjacent if $g=g^{\prime}$ and $hh^{\prime}\in E(H)$, 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)$…

A set S of vertices in a graph G is a dominating set of G if every vertex not in S is adjacent to a vertex in S . The domination number of G, denoted by $\gamma$(G), is the minimum cardinality of a dominating set in G. In a breakthrough…

The generalized order $e_G(g)$ of an element $g$ of a group $G$ is the smallest positive integer $k$ such that there exist $x_1,\ldots,x_k \in G$ such that $g^{x_1} \ldots g^{x_k}=1$, where $g^x=x^{-1}gx$. Let $e(G) = \max \{e_G(g)\ |\ g…

For a finite group $G$, let $m_I(G)$ denote the largest possible cardinality of a minimal invariable generating set of $G$. We prove an upper and a lower bound for $m_I(S_n)$, which show in particular that $m_I(S_n)$ is asymptotic to $n/2$…