Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
Maciej Kalkowski, Michal Karonski, Florian Pfender
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. 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...
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...
A k-signed r-set on [n] = {1, ..., n} is an ordered pair (A, f), where A is an rsubset of [n] and f is a function from A to [k]. Families A1, ..., Ap are said to be cross-intersec...
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...
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...