Finding the maximum and minimum elements with one lie Original Research Article

In this paper we deal with the problem of finding the smallest and the largest elements of a totally ordered set of size image using pairwise comparisons if one of the comparisons might be erroneous and prove a conjecture of Aigner stating that the minimum number of comparisons needed is image for some constant image. We also address some related problems.