ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graph is vertex transitive if, for every pair of vertices v,wv,w, there is a graph automorphism mapping vv to ww. A graph is Hamiltonian if it admits a Hamiltonian circuit, namely a simple circuit containing every vertex of the graph. Lovász's conjecture. All but a finite number of vertex-transitive graphs are Hamiltonian. It remains open whether the remaining odd graphs are Hamiltonian; this conjecture is therefore unresolved in general.

Record

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.