Additive combinatorics is the theory of counting additive structures in sets. This theory has
seen exciting developments and dramatic changes in direction in recent years thanks to its …

A latin square of order n is an n× n array of n symbols in which each symbol occurs exactly
once in each row and column. A transversal of such a square is a set of n entries containing …

A subgraph of an edge‐coloured graph is called rainbow if all its edges have distinct
colours. The study of rainbow subgraphs goes back more than 200 years to the work of …

In this paper we prove that the nonzero elements of a finite field with odd characteristic can
be partitioned into pairs with prescribed difference (maybe, with some alternatives) in each …

A complete mapping of a group $ G $ is a bijection $\phi\colon G\to G $ such that $ x\mapsto
x\phi (x) $ is also bijective. Hall and Paige conjectured in 1955 that a finite group $ G $ has a …

A generalization of the Davenport constant is investigated. For a finite abelian group G and a
positive integer k, let Dk (G) denote the smallest ℓ such that each sequence over G of length …

In combinatorial number theory, zero-sum problems, subset sums and covers of the integers
are three different topics initiated by P. Erdös and investigated by many researchers; they …

Combinatorics is a fundamental mathematical discipline as well as an essential component
of many mathematical areas, and its study has experienced an impressive growth in recent …

The binary k-dimensional simplex code is known to be a 2 k-1-batch code and is
conjectured to be a 2 k-1-functional batch code. Here, we offer a simple, constructive proof of …

A PROOF OF SNEVILY’S CONJECTURE Page 1 ISRAEL JOURNAL OF MATHEMATICS 182
(2011), 505–508 DOI: 10.1007/s11856-011-0040-6 A PROOF OF SNEVILY’S CONJECTURE …