Related papers: Infinitely many groups exhibiting intermediate gro…

Determining the size of a maximum independent set of a graph $G$, denoted by $\alpha(G)$, is an NP-hard problem. Therefore, many attempts are made to find upper and lower bounds, or exact values of $\alpha (G)$ for special classes of…

Sacerdote [Sa] has shown that the non-Abelian free groups satisfy precisely the same universal-existential sentences Th(F$_2$)$\cap \forall \exists $ in a first-order language L$_o$ appropriate for group theory. It is shown that in every…

In this paper, we make progress on a question related to one of Galvin that has attracted substantial attention recently. The question is that of determining among all graphs $G$ with $n$ vertices and $\Delta(G)\leq r$, which has the most…

Let $\{G_i :i\in\N\}$ be a family of finite Abelian groups. We say that a subgroup $G\leq \prod\limits_{i\in \N}G_i$ is \emph{order controllable} if for every $i\in \mathbb{N}$ there is $n_i\in \mathbb{N}$ such that for each $c\in G$, there…

Let $G$ be an infinite group and let $X$ be a finite generating set for $G$ such that the growth series of $G$ with respect to $X$ is a rational function; in this case $G$ is said to have rational growth with respect to $X$. In this paper a…

Let $\ell$ and $m$ be positive integers with $\ell \leq m$, and let $\mathcal{A} = (A_1, \ldots, A_m)$ be a finite sequence of finite subsets of a group $G$ (not necessarily abelian), written multiplicatively. The {\it generalized product…

Given a finite abelian group $G$ and a subset $J\subset G$ with $0\in J$, let $D_{G}(J,N)$ be the maximum size of $A\subset G^{N}$ such that the difference set $A-A$ and $J^{N}$ have no non-trivial intersection. Recently, this extremal…

Given a finitely generated residually finite group $G$, the residual finiteness growth $\text{RF}_G: \mathbb{N} \to \mathbb{N}$ bounds the size of a finite group $Q$ needed to detect an element of norm at most $r$. More specifically, if…

A longstanding conjecture asserts that every non-abelian finite $p$-group $G$ admits a non-inner automorphism of order $p$. The conjecture is valid for finite $p$-groups of class 2. Here, we prove every finite non-abelian $p$-group $G$ of…

Let $\alpha(G)$ denote the cardinality of a maximum independent set, while $\mu(G)$ be the size of a maximum matching in the graph $G=\left(V,E\right) $. If $\alpha(G)+\mu(G)=\left\vert V\right\vert $, then $G$ is a K\"onig-Egerv\'ary…

A well-known result of Tutte says that if Gamma is an Abelian group and G is a graph having a nowhere-zero Gamma-flow, then G has a nowhere-zero Gamma'-flow for each Abelian group Gamma' whose order is at least the order of Gamma. Jaeger,…

Building on previous work by Lambert, Plagne and the third author, we study various aspects of the behavior of additive bases in infinite abelian groups and semigroups. We show that, for every infinite abelian group $T$, the number of…

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

This paper opens and discusses the question originally due to Daniel Herden, who asked for which graph $(\mu,R)$ we can find a family $\{\mathbb G_\alpha: \alpha < \mu\}$ of abelian groups such that for each $\alpha,\beta\in\mu$:…

Given an inverse semigroup $G_0$ of bounded type, we show, along with some other assumptions, that if the set of incompressible elements of $G_0$ is finite, then any finitely generated subgroup $G$ of the topological full group…

Let $B(2d-1, d)$ be the subgraph of the hypercube $\mathcal{Q}_{2d-1}$ induced by its two largest layers. Duffus, Frankl and R\"odl proposed the problem of finding the asymptotics for the logarithm of the number of maximal independent sets…

Let $G$ be an abelian group. A tri-colored sum-free set in $G^n$ is a collection of triples $({\bf a}_i, {\bf b}_i, {\bf c}_i)$ in $G^n$ such that ${\bf a}_i+{\bf b}_j+{\bf c}_k=0$ if and only if $i=j=k$. Fix a prime $q$ and let $C_q$ be…

For a graph $G=(V,E)$, let $bc(G)$ denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of $G$ so that each edge of $G$ belongs to exactly one of them. It is easy to see that for every graph $G$, $bc(G) \leq n…

Every $n$-vertex planar triangle-free graph with maximum degree at most $3$ has an independent set of size at least $\frac{3}{8}n$. This was first conjectured by Albertson, Bollob\'as and Tucker, and was later proved by Heckman and Thomas.…

For a finite abelian group $G$ and a positive integer $k$, let $s_{k}(G)$ denote the smallest integer $\ell\in\mathbb{N}$ such that any sequence $S$ of elements of $G$ of length $|S|\geq\ell$ has a zero-sum subsequence with length $k$. The…