A new rearrangeable broadcast switching network has been invented. In its simplest form, the network has two stages. For larger networks, the switches in each stage can be replaced with two-stage networks to reduce crosspoint cost. The invention is based on an innovative approach of connecting each inlet channel to a multiplicity of first-stage switches according to a predetermined connection pattern. The network grows easily and has simple path hunt and rearrangement algorithms. It provides a general solution for any nonblocking broadcast switching application. Fewer crosspoints are required than in any other known two- or three-stage rearrangeable broadcast network. The connection arrangement exemplifies a topic heretofore unaddressed in combinatorial theory.