The Herzog–Schönheim Conjecture for finite simple groups
In the 1950’s Davenport, Mirsky, Newman and Rado proved that if the integers are partitioned by a finite set of arithmetic progressions, then the largest difference must appear more than once. In other words, if g1, . . ., gn and a1 ≤ a2 ≤ . . . ≤ an are integers such that {gi+aiℤ}n i=1 is a partition of ℤ then an−1 = an. This confirmed a conjecture of Erdös and opened a broad area of research (see Covering systems of Paul Erdös. Past, present and future, Paul Erdös and his mathematics, I (Budapest, 1999), Bolyai Soc. Math. Stud., vol. 11, pp. 581-627. János Bolyai Math.