On a relation between the depth and complexity of monotone Boolean formulas

We present a sequence of monotone Boolean functions whose depth over the basis $\{\vee,\wedge\}$ is $c>1.06$ times greater than the logarithm of the formula complexity. Tab. 1, bibliogr. 24.