A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path
arXiv:2001.00385
Abstract
We say a graph has a Hamiltonian path if it has a path containing all vertices of . For a graph , let denote the minimum degree sum of two nonadjacent vertices of ; restrictions on are known as Ore-type conditions. Given an integer , we prove that if a connected graph on vertices satisfies , then has either a Hamiltonian path or an induced subgraph isomorphic to . Moreover, we characterize all -vertex graphs where and has neither a Hamiltonian path nor an induced subgraph isomorphic to . This is an analogue of a recent result by Momège, who investigated the case when .