Diameter vulnerability of graphs by edge deletion

Let f(t,k)f(t,k) be the maximum diameter of graphs obtained by deleting tt edges from a (t+1)(t+1)-edge-connected graph with diameter kk. This paper shows 42t−6