Using SAT to study plane Hamiltonian substructures in simple drawings

In 1988 Rafla conjectured that every simple drawing of a complete graph \(K_n\) contains a plane, i.e., non-crossing, Hamiltonian cycle. The conjecture is far from being resolved. The lower bounds for plane paths and plane matchings have recently been raised to \((\log n)^{1-o(1)}\) and \(\Omega(\sq...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2023-05
Hauptverfasser:	Bergold, Helena, Felsner, Stefan, Reddy, Meghana M, Scheucher, Manfred
Format:	Artikel
Sprache:	eng
Schlagworte:	Graph theory Lower bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!