A ternary search problem on two disjoint sets

摘要

In (Aigner, 1988) Aigner conjectured that: 1. K-n(n = 3) is 3-optimal only for n = 5 and 8. 2. There are only finitely many 3-optimal graphs K-m,K- n for fixed m. In this paper, the precise result for the complete bipartite graphs K-5,K-n is given and the conjecture 2 is proved. (C) 2018 Elsevier B.V. All rights reserved.