ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graph GG is toroidal if it admits an embedding in the torus, i.e. there is a drawing of GG on the closed orientable surface of genus 11 in which vertices are distinct points, edges are arcs joining their endpoints, and no two edges meet except at a common endpoint. A graph GG on at least 55 vertices is 44-vertex-connected (44-connected) if it is connected and G−SG - S is connected for every set S⊆V(G)S \subseteq V(G) with ∣S∣≤3|S| \le 3. A Hamiltonian cycle of GG is a cycle in GG that passes through every vertex of GG.

For every finite simple graph GG: if GG is toroidal and 44-vertex-connected, then GG has a Hamiltonian cycle.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.