We study the arbitrarily varying relay channel, which models communication with relayingin the presence of an active adversary. We establish the cutset bound and partial decode-forwardbound on the random code capacity. We further determine the random code capacity for specialcases. Then, we consider conditions under which the deterministic code capacity is determined aswell. In addition, we consider the arbitrarily varying Gaussian relay channel with sender frequencydivision under input and state constraints. We determine the random code capacity, and establishlower and upper bounds on the deterministic code capacity. Furthermore, we show that as opposedto previous relay models, the primitive relay channel has a different behavior compared to thenon-primitive relay channel in the arbitrarily varying scenario.