The local truncation error of a one-step ODE solver is defined to be $$e_{i+1} = \lvert y(t_{i+1}) - \tilde{y}_{i+1}\rvert,$$ the absolute value of the difference between the correct solution of the "one-step initial value problem", $y(t_{i+1})$, and the value provided by the solver assuming that $y_i$ is exact, $\tilde{y}_{i+1}$.
To find the local truncation error in Euler's method, I do the following.
By Taylor's theorem,
$$ \exists c \in [t_i, t_{i+1}], \quad y(t_{i+1}) = y(t_i + h) = y(t_i) + hy'(t_i) + \frac{h^2}{2}y''(c).$$
By Euler's method,
$$y_{i+1} = y(t_i) + hf(t_i, y_i) = y(t_i) + hy'(t_i).$$
Therefore,
$$e_{i+1} = \Big\lvert \frac{h^2}{2} y''(c) \Big\rvert = \frac{Mh^2}{2}, \: M = \lvert y''(c) \rvert.$$
What is the formula for the local truncation error in RK4 and how can it be derived? Moreover, does it have practical use when trying to bound the global truncation error in the solution to an initial value probelm or are these error bounds usually estimated by other techniques?