Infinite Eulerian paths are computable on graphs with vertices of infinite degree
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2023
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910880866762752 |
|---|---|
| author | Carrasco-Vargas, Nicanor |
| author_facet | Carrasco-Vargas, Nicanor |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_17998 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Infinite Eulerian paths are computable on graphs with vertices of infinite degree Carrasco-Vargas, Nicanor Combinatorics Information Theory Group Theory Logic 05C63, 03D55, 05C45, 68R10, 03D99, 68Q01 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. |
| title | Infinite Eulerian paths are computable on graphs with vertices of infinite degree |
| topic | Combinatorics Information Theory Group Theory Logic 05C63, 03D55, 05C45, 68R10, 03D99, 68Q01 |
| url | https://arxiv.org/abs/2305.17998 |