graph (Formula presented.) is (Formula presented.) -degenerate if every nonnull subgraph of (Formula presented.) has a vertex of degree at most (Formula presented.). We prove that every (Formula presented.) -vertex planar graph has a 3-degenerate induced subgraph of order at least (Formula presented.).