Kings in Multipartite Hypertournaments

Chickens and Dukes

Following on the King Chicken Theorems originally proved by Maurer, we examine the idea of multiple flocks of chickens by bringing the chickens from tournaments to multipartite tournaments. As Kings have already been studied in multipartite settings, notably by Koh-Tan and Petrovic-Thomassen, we examine a new type of chicken more suited than Kings for these multipartite graphs: Dukes. We define an M-Duke to be a vertex from which any vertex in a different partite set is accessible by a directed path of length at most M. In analogy with Maurer's paper, we prove various structural results regard…