Advertisement

Israel Journal of Mathematics

, Volume 76, Issue 3, pp 317–336 | Cite as

Hamiltonian paths in infinite graphs

  • David Harel
Article

Abstract

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.

Keywords

Internal Node Incident Edge Hamiltonian Path Recursive Tree Infinite Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 2.
    D. R. Bean,Effective coloration, J. Sym. Logic41 (1976), 469–480.MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    D. R. Bean,Recursive Euler and Hamiltonian paths, Proc. Am. Math. Soc.55 (1976), 385–394.MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    R. Beigel and W. I. Gasarch, unpublished results, 1986–1990.Google Scholar
  5. 5.
    R. Beigel and W. I. Gasarch,On the complexity of finding the chromatic number of a recursive graph, Parts I & II, Ann. Pure and Appl. Logic45 (1989), 1–38, 227–247.MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    S. A. Burr,Some undecidable problems involving the edge-coloring and vertex coloring of graphs, Disc. Math.50 (1984), 171–177.MATHCrossRefMathSciNetGoogle Scholar
  7. 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. 8.
    W. I. Gasarch, Personal communication, 1991.Google Scholar
  9. 9.
    D. Harel,Effective transformations on infinite trees, with applications to high undecidability, dominoes and fairness, J. Assoc. Comput. Mach.33 (1986), 224–248.MathSciNetGoogle Scholar
  10. 10.
    A. Manaster and J. Rosenstein,Effective matchmaking (recursion theoretic aspects of a theorem of Philip Hall), Proc. London Math. Soc.3 (1972), 615–654.CrossRefMathSciNetGoogle Scholar
  11. 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
  12. 12.
    H. Rogers,Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.MATHGoogle Scholar

Copyright information

© Hebrew University 1991

Authors and Affiliations

  1. 1.Department of Applied Mathematics and Computer ScienceThe Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations