We show that for each η > 0 every digraph G of sufficiently large order n is Hamiltonian if its out- and indegree sequences d+ 1 ≤ · · · ≤ d+ n and d− 1 ≤ · · · ...
Abstract. For each finite field F of prime order there is a constant c such that every 4-connected matroid has at most c inequivalent representations over F. We had hoped that th...
We consider extensions and restrictions of Wythoff’s game having exactly the same set of P positions as the original game. No strict subset of rules give the same set of P posit...
A k-orbit map is a map with k flag-orbits under the action of its automorphism group. We give a basic theory of k-orbit maps and classify them up to k 4. “Hurwitz-like” upper...
Abstract. New enumerating functions for the Euler numbers are considered. Several of the relevant generating functions appear in connection to entries in Ramanujan’s Lost Noteboo...