  We prove that any bounded degree regular graph with sufficiently strong
spectral expansion contains an induced path of linear length. This is the first
such result for expanders, strengthening an analogous result in the random
setting by Dragani\'c, Glock and Krivelevich. More generally, we find long
induced paths in sparse graphs that satisfy a mild upper-uniformity
edge-distribution condition.
