## Upper bound on the length of chordless cycles in d-regular graphs

Given a $$d$$-regular graph with $$n$$ vertices is there a known (non-trivial) upper bound on the length of chordless cycles in it (presumably as a function of $$d$$ and $$n$$)? I wasn’t able to find anything after some online searches. Thank you.