Directed Cut-Query Complexity of Finding a King

arXiv:2610.40521 · cs.CC, math.CO · Submitted 2026-10-29 · Read on arXiv

cs.CC, math.CO

Submitted: 2026-10-29

Updated: 2026-10-29

License: http://creativecommons.org/licenses/by/4.0/

The gist: A king in a tournament is a vertex from which every other vertex is reachable by a directed path of length at most two.

Terminology

Abstract

A king in a tournament is a vertex from which every other vertex is reachable by a directed path of length at most two. We study the deterministic query complexity of finding a king when a query specifies a set of vertices and returns the number of edges directed from that set to its complement. We prove that this complexity is Θ(n) for n-vertex tournaments. To show this, we first show that every correct deterministic algorithm in this model must output a maximum-outdegree vertex, even though a king need not have maximum outdegree. We then give an adversary whose answers, after too few queries, remain consistent with a tournament in which the algorithm's output does not have maximum outdegree.

Related papers