ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with a path factor, let Δ(G)\Delta(G) be its maximum degree, and let PnP_n be the path on nn vertices. The Cartesian product Pn□GP_n\square G is balanced bipartite when its two bipartition classes have equal size. The balanced-bipartite Cartesian-product Hamiltonicity conjecture. If n≥4Δ(G)−2n\geq 4\Delta(G)-2 and Pn□GP_n\square G is balanced bipartite, then Pn□GP_n\square G is Hamiltonian. This conjecture proposes Hamiltonicity under the stated degree bound and balance condition; the supplied text gives no resolution status.

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.