A link between Menger's theorem and infinite Euler graphs (Q1307372): Difference between revisions

An infinite graph \(G\) is usually called Eulerian if there is an Eulerian trail in \(G\), i.e., a one-way or two-way infinite trail which contains all the edges of \(G\). In both cases, it is obviously necessary that \(V(G)\) be countable and that \(G\) be, at most, two ended (in the case of one-way trail \(G\) must be one ended, which means that for each finite \(K\subset G\) there are, at most, two infinite components in \(G-K\) (one infinite component in the case of one ended)). It is the purpose of this note to extend the definition of an infinite Eulerian graph in such a way that the above restrictions on the number of ends are not required, but such that in the cases previously considered the ``old'' notion of Eulerian graph appears as a special case.