ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. A connected {2,4}\{2,4\}-factor is a connected spanning subgraph of GG in which every vertex has degree either 22 or 44. Connected {2,4}\{2,4\}-factor conjecture. Every 22-tough graph of order at least three admits a connected {2,4}\{2,4\}-factor. This is proposed as a revision of Chvátal's disproved Hamiltonian-cycle conjecture; the source gives no resolution of this stronger factor statement.

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.