Hamiltonian cycles in neighbor-swap graphs

master's thesis

Ana Smerdu (Author), Tom Verhoeff (Mentor), Arjana Žitnik (Co-mentor)

Abstract

In 1965 Derrick Henry Lehmer conjectured that every neighbor-swap graph admits an imperfect Hamiltonian path. This path, also known as Lehmer path, is a walk visiting all the vertices of a graph where some of them might be visited twice in a row. For most of the neighbor-swap graphs the conjecture is already proved, it remains open only for two families of graphs. We will present known results with their proofs in the thesis. It turns out most of these graphs even contain a Lehmer cycle and we will show how to construct them. For the missing part of the proof we will present a possible approach, that might finally confirm D. H. Lehmer's conjecture. First we find a Hamiltonian path in a related binary neighbor-swap graph and then step by step add the missing symbols, connecting the paths together into a Lehmer path.

Keywords

mathematics;neighbor-swap graphs;multisets;permutations;transpositions;Hamiltonian paths;Lehmer paths;posets;

Data

Language:	English
Year of publishing:	2019
Typology:	2.09 - Master's Thesis
Organization:	UL FMF - Faculty of Mathematics and Physics
Publisher:	[A. Smerdu]
UDC:	519.1
COBISS:	18676313
Views:	1242
Downloads:	249
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	Slovenian
Secondary title:	Hamiltonovi cikli v grafih transpozicij sosedov
Secondary abstract:	Lehmerjeva pot je nepopolna Hamiltonova pot in je definirana kot sprehod, kjer obiščemo vsa vozlišča v grafu, nekatera pa lahko obiščemo dvakrat zapored. Leta 1965 je Derrick Henry Lehmer postavil domnevo, da vsak graf transpozicij sosedov vsebuje Lehmerjevo pot. Domneva je v veliki meri že dokazana in te izreke z dokazi bomo v magistrski nalogi tudi predstavili. Izkaže se, da je v mnogih primerih možna celo konstrukcija Lehmerjevega cikla, kar bomo tudi pokazali. Za mankajoči del dokaza bomo podali možen pristop, ki bi domnevo D. H. Lehmerja dokončno potrdil. Najprej poiščemo Hamiltonovo pot v sorodnem dvojiškem grafu transpozicij sosedov, nato pa s konstrukcijo Stachowiaka postopoma dodajamo manjkajoče simbole in združujemo dobljene Lehmerjeve poti.
Secondary keywords:	matematika;graf transpozicij sosedov;večkratne množice;permutacije;transpozicije;Hamiltonove poti;Lehmerjeve poti;delno urejene množice;
Type (COBISS):	Master's thesis/paper
Study programme:	0
Thesis comment:	Univ. v Ljubljani, Fak. za matematiko in fiziko, Oddelek za matematiko, Matematika - 2. stopnja
Pages:	XI, 54 str.
ID:	11193864