2-connected infinite graph has infinite trail
Source: KoMaL A. 866
January 13, 2024
combinatoricsgraph theory
Problem Statement
Is it true that in any -connected graph with a countably infinite number of vertices it's always possible to find a trail that is infinite in one direction?Submitted by Balázs Bursics and Anett Kocsis, Budapest