Abstract. The problem of finding two radioactive balls among a given set of balls is reduced to a combinatorial recognition problem, the latter solved by a series of tests. In so doing, methods of graph theory are employed. To illustrate this approach, an example with 22 balls is given.

Keywords: limited sample, unlimited sample, complete graph, bipartite graph, search graph, active balls, active edge, positive test result, negative test result.