For any $r,g$, is there an $r$-regular graph of girth $g$? From wikipedia's page Cage graph

Formally, an $(r,g)$-graph is defined to be a graph in which each
  vertex has exactly $r$ neighbors, and in which the shortest cycle has
  length exactly $g$. It is known that an $(r,g)$-graph exists for any
  combination of $r \geq 2$ and $g \geq 3$.

Can someone provide a proof of this claim?
Thanks.

*

*A cycle of length $g$ is a $(2,g)$-graph.

*The graphs of the Platonic solids are $(3,3)$-, $(3,4)$-, $(4,3)$-, $(3,5)$-, and $(5,3)$-graphs.

*Regular tilings of the Euclidean plane by triangles, squares, and hexagons are $(3,6)$-, $(4,4)$-, and $(6,3)$-graphs, respectively.  If you insist on a finite graph, take a large parallelogram whose vertices lie on the lattice, and identify opposite edges to obtain a torus.

*Regular tilings of the hyperbolic plane give $(r,g)$-graphs for any other pair $(r,g)$.  Again, one can obtain finite $(r,g)$-graphs by choosing a sufficiently large portion of the infinite $(r,g)$-tiling and rolling it up into a surface (which must have genus at least 2).
Finally, if you don't insist that all graphs are simple, it is easy to construct $(2,2)$-graphs and $(1,g)$-graphs for all $g\ge 1$.
