In this manuscript, we give a new proof of strong minimality of certain automorphic functions, originally results of Freitag and Scanlon (2017), Casale, Freitag, and Nagloo (2020), Blázquez-Sanz, Casale, Freitag, and Nagloo (2020). Our proof is shorter and conceptually different than those presently in the literature.

In this paper we develop a new technique for showing that a nonlinear algebraic differential equation is strongly minimal based on the recently developed notion of the degree of non-minimality of Freitag and Moosa. Our techniques are sufficient to show that generic order $h$ differential equations with non-constant coefficients are strongly minimal, answering a question of Poizat (1980).

A spanning tree of an edge-colored graph is rainbow provided that each of its edges receives a distinct color. In this paper we consider the natural extremal problem of maximizing and minimizing the number of rainbow spanning trees in a graph $G$. Such a question clearly needs restrictions on the colorings to be meaningful. For edge-colorings using $n-1$ colors and without rainbow cycles, known in the literature as JL-colorings, there turns out to be a particularly nice way of counting the rainbow spanning trees and we solve this problem completely for JL-colored complete graphs $K_n$ and complete bipartite graphs $K_{n,m}$. In both cases, we find tight upper and lower bounds; the lower bound for $K_n$, in particular, proves to have an unexpectedly chaotic and interesting behavior. We further investigate this question for JL-colorings of general graphs and prove several results including characterizing graphs which have JL-colorings achieving the lowest possible number of rainbow spanning trees. We establish other results for general $n-1$ colorings, including providing an analogue of Kirchoff's matrix tree theorem which yields a way of counting rainbow spanning trees in a general graph $G$.

Suppose r ≥ 3 and k ≥ 2 are integers. If k(r − 1) is even then the edge Grundy number of the Turán graph Tkr,r is 2k(r − 1) − 1. Otherwise, the edge Grundy number of Tkr,r is 2k(r − 1) − m for some m ∈ {1, . . . ,min[g(k), 2r − 1]}, where g(k) = 2 if k = 3 and g(k) = k − 2 otherwise.

The edge Grundy numbers of graphs in a number of different classes are determined, notably for the complete and the complete bipartite graphs, as well as for the Petersen graph, the grids, and the cubes. Except for small-graph exceptions, these edge Grundy numbers turn out to equal a natural upper bound of the edge Grundy number, or to be one less than that bound.