Grading of triangulations generated by bisection

For triangulations generated by the adaptive bisection algorithm by Maubach and Traxler we prove existence of a regularized mesh function with grading two. This sharpens previous results in two dimensions for the newest vertex bisection and generalizes them to arbitrary dimensions. In combination with Diening, Storn, and Tscherpel [SIAM J. Numer. Anal. 59 (2021), pp. 2571–2607] this yields <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper H Superscript 1"> <mml:semantics> <mml:msup> <mml:mi>H</mml:mi> <mml:mn>1</mml:mn> </mml:msup> <mml:annotation encoding="application/x-tex">H^1</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-stability of the <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper L squared"> <mml:semantics> <mml:msup> <mml:mi>L</mml:mi> <mml:mn>2</mml:mn> </mml:msup> <mml:annotation encoding="application/x-tex">L^2</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-projection onto Lagrange finite element spaces for all polynomial degrees and dimensions smaller than seven.