There are several known results asserting that undirected graphs can be partitioned in a way that satisfies various constraints imposed on the degrees. The corresponding results for directed graphs, where degrees are replaced by outdegrees, often fail, and when they do hold, they are usually much harder, and lead to fascinating open problems. In this note we list three problems of this type, and mention the undirected analogues. All graphs and digraphs considered here are simple, that is, they have no loops and no multiple edges.

For a fixed graph $H$, we define the rainbow Turán number $\ex^*(n,H)$ to be the maximum number of edges in a graph on $n$ vertices that has a proper edge-colouring with no rainbow $H$. Recall that the (ordinary) Turán number $\ex(n,H)$ is the maximum number of edges in a graph on $n$ vertices that does not contain a copy of $H$. For any non-bipartite $H$ we show that $\ex^*(n,H)=(1+o(1))\ex(n,H)$, and if $H$ is colour-critical we show that $\ex^{*}(n,H)=\ex(n,H)$. When $H$ is the complete bipartite graph $K_{s,t}$ with $s \leq t$ we show $\ex^*(n,K_{s,t}) = O(n^{2-1/s})$, which matches the known bounds for $\ex(n,K_{s,t})$ up to a constant. We also study the rainbow Turán problem for even cycles, and in particular prove the bound $\ex^*(n,C_6) = O(n^{4/3})$, which is of the correct order of magnitude.

Let $P(G,t)$ and $F(G,t)$ denote the chromatic and flow polynomials of a graph $G$. G. D. Birkhoff and D C. Lewis showed that, if $G$ is a plane near-triangulation, then the only zeros of $P(G,t)$ in $(-\infty,2]$ are 0, 1 and 2. We will extend their theorem by showing that a stronger result to the dual statement holds for both planar and non-planar graphs: if $G$ is a bridge graph with at most one vertex of degree other than three, then the only zeros of $F(G,t)$ in $(-\infty,\alpha]$ are 1 and 2, where $\alpha\approx 2.225\cdots$ is the real zero in $(2,3)$ of the polynomial $t^4-8t^3+22t^2-28t+17$. In addition we construct a sequence of ‘near-cubic’ graphs whose flow polynomials have zeros converging to $\alpha$ from above.

We answer three questions posed in a paper by Babson and Benjamini. They introduced a parameter $C_G$ for Cayley graphs $G$ that has significant application to percolation. For a minimal cutset of $G$ and a partition of this cutset into two classes, take the minimal distance between the two classes. The supremum of this number over all minimal cutsets and all partitions is $C_G$. We show that if it is finite for some Cayley graph of the group then it is finite for any (finitely generated) Cayley graph. Having an exponential bound for the number of minimal cutsets of size $n$ separating $o$ from infinity also turns out to be independent of the Cayley graph chosen. We show a 1-ended example (the lamplighter group), where $C_G$ is infinite. Finally, we give a new proof for a question of de la Harpe, proving that the number of $n$-element cutsets separating $o$ from infinity is finite unless $G$ is a finite extension of $\mathbb{Z}$.

Let $\chi(n)$ be a quadratic character modulo a prime $p$. For a fixed integer $s\ne 0$, we estimate certain exponential sums with truncated $L$-functions \[L_{s,p}(n) = \sum_{j=1}^n \frac{\chi(\,j)}{j^s}\qquad (n =1, 2, \ldots)\]. Our estimate implies certain uniformly of distribution properties of reductions of $L_{s,p}(n)$ in the residue classes modulo $p$.

Answering a question of Hoffmann and of Kambites, an example is exhibited of a finitely generated semigroup $S$ such that $S$ embeds in a group and $S$ is not automatic, but the universal group of $S$ is automatic.

We establish some upper and lower bounds for the number of rational points of Prym varieties defined over finite fields. They are better than the usual Weil bounds valid for any abelian varieties defined over such fields.

The Hansen-Mullen Primitivity Conjecture (HMPC) (1992) asserts that, with some (mostly obvious) exceptions, there exists a primitive polynomial of degree $n$ over any finite field with any coefficient arbitrarily prescribed. This has recently been proved whenever $n \geq 9$. It is also known to be true when $n \leq 3$. We show that there exists a primitive polynomial of any degree $n\geq 4$ over any finite field with its second coefficient (i.e., that of $x^{n-2}$) arbitrarily prescribed. In particular, this establishes the HMPC when $n=4$. The lone exception is the absence of a primitive polynomial of the form $x^4+a_1x^3 +x^2+a_3x+1$ over the binary field. For $n \geq 6$ we prove a stronger result, namely that the primitive polynomial may also have its constant term prescribed. This implies further cases of the HMPC. When the field has even cardinality 2-adic analysis is required for the proofs.