ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graph is 2K22K_2-free if it has no induced subgraph consisting of two independent edges, and it is tt-tough if ∣S∣≥t c(G−S)|S|\geq t\,c(G-S) whenever deletion of SS leaves at least two components. A graph is hamiltonian if it has a spanning cycle.

Mou and Pasechnik's conjecture. Every 22-tough 2K22K_2-free graph with at least three vertices is hamiltonian.

The source presents this as one of two conjectures proposed by Mou and Pasechnik and gives no resolution for it here.

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.