A three terminal erasure relay channel is considered. It has been shown that appropriately designed maximum distance separable codes achieve the cut-set upper bound on capacity of the three terminal erasure relay channel. This paper presents low-density parity-check (LDPC) coding alternatives for this channel. Design rules for constructing LDPC codes that perform close to the cut-set upper bound on capacity are provided for the general erasure relay channel and also the degraded erasure relay channel, wherein all the information available at the receiver are also available at the relay