Leaf realization problem, caterpillar graphs and prefix normal words

Alexandre Blondin Massé, Julien de Carufel, Alain Goupil +3

Given a simple graph $G$ with $n$ vertices and a natural number $i\le n$, let $L_G(i)$ be the maximum number of leaves that can be realized by an induced subtree $T$ of $G$ with…