Selecting Non-consecutive Balls Arranged in Many Lines

Abstract Kaplansky obtained the number of ways of selecting k balls from n balls arranged in a line without two selected ones being consecutive. Here his result is generalized to the case of any number of lines where each line can contain any number of balls. Several interesting corollaries are derived; one of them reduces to a result of Konvalina's.