Résumé
Abstract Let X be a set of n points in in general position. What is the maximum number of vertices that can have among all the possible permissible projective transformations T ? In this paper, we investigate this and other related questions. After presenting several upper bounds, obtained by using oriented matroid machinery, we study a closely related problem (via Gale transforms) concerning the maximal number of minimal Radon partitions of a set of points. The latter led us to a result supporting a positive answer to a question of Pach and Szegedy asking whether balanced 2‐colorings of points in the plane maximize the number of induced multicolored Radon partitions. We also discuss a related problem concerning the size of topes in arrangements of hyperplanes as well as a tolerance‐type problem of finite sets.