2023/05/29 by Nicanor Carrasco-Vargas, Carrasco-Vargas, Nicanor
Computer Science · #03D55 #03D99 #05C45 #05C63 #68Q01 #68R10 #Advanced Graph Theory Research #Combinatorics (math.CO) #Digital Image Processing Techniques #FOS: Computer and information sciences #FOS: Mathematics #Group Theory (math.GR) #Information Theory (cs.IT) #Logic (math.LO) #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.2305.17998
openalex publication_date 2023/05/29 · openalex created_date 2023/05/31 · openalex updated_date 2026/07/28
The Erdős, Grünwald, and Weiszfeld theorem is a characterization of those infinite graphs which are Eulerian. That is, infinite graphs that admit infinite Eulerian paths. In this article we prove an effective version of the Erdős, Grünwald, and Weiszfeld theorem for a class of graphs where vertices of infinite degree are allowed, generalizing a theorem of D.Bean. Our results are obtained from a characterization of those finite paths in a graph that can be extended to infinite Eulerian paths.