maximum leaf number

• 2019 Sorge2019
  • page 8 : maximum leaf number $k$ upper bounds distance to linear forest by $\mathcal O(k)$ – Lemma 4.10 ([14]). The max-leaf number $\mathrm{ml}$ upper bounds the distance to disjoint paths $d$. We have $d \le \mathrm{ml}-1$.
  • page 10 : maximum leaf number $k$ upper bounds bandwidth by $\mathcal O(k)$ – Lemma 4.25. The max leaf number $\mathrm{ml}$ strictly upper bounds the bandwidth $\mathrm{bw}$.
• SchroderThesis
  • page 21 : bounded maximum leaf number does not imply bounded girth – Proposition 3.14
• unknown
  • maximum leaf number $k$ upper bounds distance to linear forest by $f(k)$
  • maximum leaf number $k$ upper bounds feedback edge set by $f(k)$
  • cycle upper bounds maximum leaf number by a constant
  • maximum leaf number $k$ upper bounds feedback edge set by $k^{\mathcal O(1)}$ – M. Bentert (personal communication)
• https://mathworld.wolfram.com/MaximumLeafNumber.html
  • maximum leaf number – … the largest number of tree leaves in any of its spanning trees.