A ternary search problem on two disjoint sets

作者：Li, Shengjia^*; Wu, Xiaohui^*; Triesch, Eberhard

来源：Discrete Applied Mathematics, 2018, 251: 221-235.

DOI：10.1016/j.dam.2018.05.026

• Search theory
• Group tests
• Complete bipartite graphs

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.

• 出版日期2018-12-31
• 单位山西大学