Monotone circuits for matching require linear depth
Ran Raz, Avi Wigderson · Journal of the ACM · 1992
It is proven that monotone circuits computing the perfect matching function on n -vertex graphs require Ω( n ) depth. This implies an exponential gap between the depth of monotone and nonmonotone circuits.