<p><b>Abstract</b>—In this paper, we aim to embed longest fault-free paths in an <it>n</it>-dimensional star graph with edge faults. When <tmath>$n\geq6$</tmath> and there are <tmath>$n-3$</tmath> edge faults, a longest fault-free path can be embedded between two arbitrary distinct vertices, exclusive of two exceptions in which at most two vertices are excluded. Since the star graph is regular of degree <tmath>$n-1$</tmath>, <tmath>$n-3$</tmath> (edge faults) is maximal in the worst case. When <tmath>$n\geq6$</tmath> and there are <tmath>$n-4$</tmath> edge faults, a longest fault-free path can be embedded between two arbitrary distinct vertices. The situation of <tmath>$n<6$</tmath> is also discussed.</p>