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...
In [11], Kalai investigated the probability of a rational outcome for a generalized social welfare function (GSWF) on three alternatives, when the individual preferences are unifo...
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...
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...