Hamiltonicity below Dirac's condition

02/05/2019
by   Bart M. P. Jansen, et al.
0

Dirac's theorem (1952) is a classical result of graph theory, stating that an n-vertex graph (n ≥ 3) is Hamiltonian if every vertex has degree at least n/2. Both the value n/2 and the requirement for every vertex to have high degree are necessary for the theorem to hold. In this work we give efficient algorithms for determining Hamiltonicity when either of the two conditions are relaxed. More precisely, we show that the Hamiltonian cycle problem can be solved in time c^k · n^O(1), for some fixed constant c, if at least n-k vertices have degree at least n/2, or if all vertices have degree at least n/2-k. The running time is, in both cases, asymptotically optimal, under the exponential-time hypothesis (ETH). The results extend the range of tractability of the Hamiltonian cycle problem, showing that it is fixed-parameter tractable when parameterized below a natural bound. In addition, for the first parameterization we show that a kernel with O(k) vertices can be found in polynomial time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/06/2020

Algorithmic Extensions of Dirac's Theorem

In 1952, Dirac proved the following theorem about long cycles in graphs ...
research
08/03/2022

Finding a Lower Bound for k-Unbounded Hamiltonian Cycles

Methods to determine the existence of Hamiltonian Cycles in graphs have ...
research
01/23/2015

A Reconfigurations Analogue of Brooks' Theorem and its Consequences

Let G be a simple undirected graph on n vertices with maximum degree Δ. ...
research
09/24/2020

An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs

We present a polynomial space Monte Carlo algorithm that given a directe...
research
05/31/2020

Generalized Hamiltonian Dynamics and Chaos in Evolutionary Games on Networks

We study the network replicator equation and characterize its fixed poin...
research
10/12/2020

Graph Square Roots of Small Distance from Degree One Graphs

Given a graph class ℋ, the task of the ℋ-Square Root problem is to decid...
research
05/03/2023

Approximating Long Cycle Above Dirac's Guarantee

Parameterization above (or below) a guarantee is a successful concept in...

Please sign up or login with your details

Forgot password? Click here to reset