on n nodes has an anchor of size O(log n). XXX Moni wanted an exact statement here giving the constant in the Big Oh XXX and a proof of the statement. I have slogged on this paper too long XXX and I am out of patience to do that. Converting the paper from tro to XXX latex was a very unrewarding activity. The proof is immediate and is omitted. The problem of… (More)

Denition 2 An anchor in a tournament, T = (V; E ) is a subset S V such that 8u; v 2 V 0 S 9w 2 S such that exactly one of (u; w) and (v; w) is an arc of

Denition 2 An anchor in a tournament, T = (V; E…

Determining an anchor of minimum size is NP-Complete

Determining an anchor of minimum size is NP…

There are tournaments that require n=2 nodes in any anchor. 3. Every anchor in every tournament must be of size (log n)