Using SAT to study plane Hamiltonian substructures in simple drawings

05/16/2023
by   Helena Bergold, et al.
0

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 Ω(√(n)), respectively. We develop a SAT framework which allows the study of simple drawings of K_n. Based on the computational data we conjecture that every simple drawing of K_n contains a plane Hamiltonian subgraph with 2n-3 edges. We prove this strengthening of Rafla's conjecture for convex drawings, a rich subclass of simple drawings. Our computer experiments also led to other new challenging conjectures regarding plane substructures in simple drawings of complete graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/27/2023

Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs

It is a longstanding conjecture that every simple drawing of a complete ...
research
09/02/2022

Shooting Stars in Simple Drawings of K_m,n

Simple drawings are drawings of graphs in which two edges have at most o...
research
03/07/2023

An extension theorem for signotopes

In 1926, Levi showed that, for every pseudoline arrangement 𝒜 and two po...
research
09/07/2022

On the Second Kahn–Kalai Conjecture

For any given graph H, we are interested in p_crit(H), the minimal p suc...
research
11/30/2021

Acute Tours in the Plane

We confirm the following conjecture of Fekete and Woeginger from 1997: f...
research
03/20/2019

Equitable partition of plane graphs with independent crossings into induced forests

The cluster of a crossing in a graph drawing on the plane is the set of ...
research
08/11/2022

Empty Triangles in Generalized Twisted Drawings of K_n

Simple drawings are drawings of graphs in the plane or on the sphere suc...

Please sign up or login with your details

Forgot password? Click here to reset