I tried DeepL (which I prefer over Google for many purposes); I OCR'd the text from the abstract (the pdf contains poor quality text, OCR'ing it yourself gives better results), pasted the OCR'ed text into DeepL, and received the following, without any edits from my side. This seems quite usable to me, if you read it together with the original that contains the formulas.
Regular graphs of given waist width with minimum number of nodes
PAUL ERDÖs and HORST SACHS*)
An estimation for the minimal number of nodes of regular graphs, which do not contain a circle of length < I Let G') be a graph with n vertices; vertices of G) are denoted by x, ..., y,..., edges are denoted by (2,, x,). Loops and bipartitions are not allowed. The valence (or order) 2 () of a vertex x of () is the number of edges that coincide with x. Let G(7) be a graph with the nodes X,, ..., Xn, which contains edge (x,, x,) but no edge (∞,, Xg); (G*") - (x,, x,) + (x,, x.)) is obtained from Eq) by omitting the edge (x,, x,) and adding the edge (2,, xg). A circle is a simply closed set of edges. Let the distance (or distance) e (G'*); x;, x,) from x, and x, in G'n) be the length of the shortest edge move connecting x; and x; (the length of an edge move or circle is the number of edges occurring in the edge train or circle). The length of the shortest circle in G we call the waist width of G'". Let K (x, r) be the set of all node- points which can be reached from x by an edge of length S r (we should actually write K (G'); x, r) but we do not do this, because we will use this symbol in a way that no misunderstanding can arise in this case). can arise). Let S be the number of elements of a set S.