An isomorphism certiicate of a labeled tournament T is a labeled subdigraph of T which together with an unlabeled copy of T allows the errorless reconstruction of T. It is shown that any tournament on n vertices contains an isomorphism certiicate with at most n log 2 n edges. This answers a question of Fishburn, Kim and Tetali. A score certiicate of T is a… (More)
Figures and Tables
Sorry, we couldn't extract any figures or tables for this paper.