Some thirty-five years ago, Suprunenko proved that every symmetric group S~ possesses a unique conjugacy class of maximal (with respect to inclusion) nilpotent transitive subgroups, and also the intransitive maximal nilpotent subgroups of Sn can be classified (see [3]). The purpose of this paper is the classification of all maximal supersoluble subgroups in symmetric groups. In contrast to the nilpotent case, there is usually more than one conjugacy class of maximal supersoluble transitive subgroups in S~; even more, there is no bound (independent of n) on the number of those conjugacy classes. The proof of the main result in this paper splits into two parts. In Section 4 we present a certain general construction of maximal supersoluble transitive subgroups of a given symmetric group Sn and in Section 5 we show that there are no others. The construction depends on certain ,~admissible, factorizations of n and on the choice of a certain regular abelian group. Different admissible factorization of n yield different conjugacy classes of maximal supersoluble transitive subgroups of S~; whether there are any non-trivial admissible factorizations of n (the trivial ones are n = n. 1 if n is odd and n = (n/2). 2 if n is even) depends on the primes involved in n. Exactly when there are odd prime divisors p and q of n such that q divides p 1 or when 4 divides n and n is not a power of 2, there exist a non-trivial admissible factori-