Hamilton Circuit reduces to Directed Hamilton Circuit #
The undirected problem is the directed one on the symmetrized instance, so
the reduction between them is a one-dimensional, single-tag interpretation
that replaces each edge by its two arcs
(DescriptiveComplexity.hamCircuit_fo_reduction_dirHamCircuit). It is what carries
the hardness of HAMILTON CIRCUIT over to DIRECTED HAMILTON CIRCUIT, which is
why the gadget work (from Vertex Cover) only has to be done once, on the
undirected side.
The interpretation of a digraph in a graph: the universe is unchanged and each edge becomes a pair of opposite arcs.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Dependency graph
The point of the interpreted structure over a.
Instances For
Dependency graph
The interpreted universe is a copy of the original one.
Equations
Instances For
Dependency graph
Dependency graph
Dependency graph
The arcs of the interpreted structure are the edges of the original one.
Dependency graph
Correctness: a graph has a Hamilton circuit exactly when its symmetrization has a directed one.
Dependency graph
HAMILTON CIRCUIT FO-reduces to DIRECTED HAMILTON CIRCUIT: replace each edge by its two arcs, the universe unchanged.
Equations
- One or more equations did not get rendered due to their size.