Local Conditions for Long Cycles in Graphs

Sammanfattning: A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is called Hamiltonian if it contains such a cycle. The problem of determining if a graph is Hamiltonian has been studied extensively, and there are many known sufficient conditions both for Hamiltonicity and for other, related properties.A large portion of these conditions relate the degrees of vertices of the graph to the number of vertices in the entire graph, and thus they can only apply to a limited set of graphs with high edge density. In a series of papers, Asratian and Khachatryan developed local analogues of some of these criteria. These results do not suffer from the same drawbacks as their global counterparts, and apply to larger classes of graphs.In this thesis we study this approach of creating local conditions for Hamiltonicity and related properties, and use it to develop local analogues of some classic results. We will also see how these local conditions can allow us to extend theorems on Hamiltonicity to infinite graphs.