English

A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs

Combinatorics 2019-03-29 v1

Abstract

Among the well-known sufficient degree conditions for the Hamiltonicity of a finite graph, the condition of Asratian and Khachatrian is the weakest and thus gives the strongest result. Diestel conjectured that it should extend to locally finite infinite graphs~GG, in that the same condition implies that the Freudenthal compactification of GG contains a circle through all its vertices and ends. We prove Diestel's conjecture for claw-free graphs.

Keywords

Cite

@article{arxiv.1903.11663,
  title  = {A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs},
  author = {Karl Heuer},
  journal= {arXiv preprint arXiv:1903.11663},
  year   = {2019}
}

Comments

20 pages, 8 figures