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

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~G, in that the same condition implies that the Freudenthal compactification of G contains a circle through all its vertices and ends. We prove Diestel's conjecture for claw-free graphs.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…