A lower bound on the box-counting dimension of crossings in fractal percolation

We consider Mandelbrot's fractal percolation process, obtained by repeated subdivision of the unit square, and obtain an explicit almost sure lower bound on the lower box-counting dimension of paths within the retained set that cross the square from left to right.