Skip to content

Read-only version: For security reasons, the Research Information System (FIS) has been temporarily replaced by this read-only version. All public content and full texts remain available; login, editing, submission and statistics are not available. Questions: fis@uni-bamberg.de

Home › Publications › An explicit construction of graphs of bounded degree that are far from being Hamiltonian

Publication

An explicit construction of graphs of bounded degree that are far from being Hamiltonian

Adler, Isolde; Köhler, Noleen (2022): An explicit construction of graphs of bounded degree that are far from being Hamiltonian, in: Discrete mathematics and theoretical computer science : DMTCS, Nancy: LORIA, Jg. 24, Nr. 1, S. 1–19, doi: 10.46298/dmtcs.7109.

Details

Author
Köhler, Noleen
Title of the Journal
Discrete mathematics and theoretical computer science : DMTCS
ISSN
1365-8050
Publisher Information
LORIA : Nancy
Year of publication
2022
Volume
24
Issue
1
Language
English
DOI
Abstract

Hamiltonian cycles in graphs were first studied in the 1850s. Since then, an impressive amount of research has been dedicated to identifying classes of graphs that allow Hamiltonian cycles, and to related questions. The corresponding decision problem, that asks whether a given graph is Hamiltonian (i.\,e.\ admits a Hamiltonian cycle), is one of Karp's famous NP-complete problems. In this paper we study graphs of bounded degree that are \emph{far} from being Hamiltonian, where a graph G on n vertices is \emph{far} from being Hamiltonian, if modifying a constant fraction of n edges is necessary to make G Hamiltonian. We give an explicit deterministic construction of a class of graphs of bounded degree that are locally Hamiltonian, but (globally) far from being Hamiltonian. Here, \emph{locally Hamiltonian} means that every subgraph induced by the neighbourhood of a small vertex set appears in some Hamiltonian graph. More precisely, we obtain graphs which differ in Θ(n) edges from any Hamiltonian graph, but non-Hamiltonicity cannot be detected in the neighbourhood of o(n) vertices. Our class of graphs yields a class of hard instances for one-sided error property testers with linear query complexity. It is known that any property tester (even with two-sided error) requires a linear number of queries to test Hamiltonicity (Yoshida, Ito, 2010). This is proved via a randomised construction of hard instances. In contrast, our construction is deterministic. So far only very few deterministic constructions of hard instances for property testing are known. We believe that our construction may lead to future insights in graph theory and towards a characterisation of the properties that are testable in the bounded-degree model.

GND Keywords
Diskrete Mathematik
Berechnungskomplexität
Datenstruktur
Algorithmus
Keywords
Computer Science - Discrete Mathematics
Computer Science - Computational Complexity
Computer Science - Data Structures and Algorithms,G.2.2
DDC Classification
004 Computer science
500 Science
RVK Classification
SK 890
Peer Reviewed
yes
International Distribution
yes
Open Access Journal
yes
Type
Article
URI
Activation date
2023-08-22

Permalink: https://fis.uni-bamberg.de/handle/uniba/90097 · Data as JSON · Cite: BibTeX · RIS

Data as of: 2026-11-16

Restricted read-only access: login, editing and submission are temporarily disabled.