Controllable connector (Q2639834)

The short communication, legible only for those familiar with the problems of non-blocking networks, is closely connected to two previous papers of the authors and mainly to the paper by Feldman, Friedman and Pippenger (c.f. below) who introduced the concept of controllable connector. The present paper introduces a new sufficient condition for a graph to be a controllable concentrator which weakens the condition from [\textit{P. Feldman}, \textit{J. Friedman} and \textit{N. Pippenger}, J. Assoc. Comput. Mach. 33, 247-254 (1986)].