We prove that any monotone switching network solving directed connectivity on N vertices must have size at least N^{\Omega(\log N)}

We prove that any monotone switching network solving directed connectivity on N vertices must have size N^{\Omega(\log N)}