Hamiltonian paths in infinite graphs
- 40 Downloads
A tight connection is exhibited between infinite paths in recursive trees and Hamiltonian paths in recursive graphs. A corollary is that determining Hamiltonicity in recursive graphs is highly undecidable, viz, Σ 1 1 -complete. This is shown to hold even for highly recursive graphs with degree bounded by 3. Hamiltonicity is thus an example of an interesting graph problem that is outside the arithmetic hierarchy in the infinite case.
KeywordsInternal Node Incident Edge Hamiltonian Path Recursive Tree Infinite Graph
Unable to display preview. Download preview PDF.
- 1.R. Aharoni, M. Magidor and R. A. Shore,On the strength of König’s duality theorem for infinite bipartite graphs, manuscript, 1990.Google Scholar
- 4.R. Beigel and W. I. Gasarch, unpublished results, 1986–1990.Google Scholar
- 7.W. I. Gasarch and M. Lockwood,The existence of matchings for recursive and highly recursive bipartite graphs, Technical Report 2029, Univ. of Maryland, May 1988.Google Scholar
- 8.W. I. Gasarch, Personal communication, 1991.Google Scholar
- 11.A. Nerode and J. Remmel,A survey of lattices of R. E. substructures, in Recursion Theory, Proc. Symp. in Pure Math., Vol. 42 (A. Nerode and R. A. Shore, eds.), Am. Math. Soc., Providence, R. I., 1985, pp. 323–375.Google Scholar