Extremal number of edges in graphs without homeomorphically irreducible spanning trees

Yibo Li, Huiqing Liu, Xiaolan Hu

For integers $k\ge 1$ and $n\ge k+1$, let ${\mathrm{ex}}_k^{\mathrm{HIST}}(n)$ denote the maximum number of edges in a $k$-connected graph of order $n$ which contains no homeom…