Connected {2,4}-factor conjecture for 2-tough graphs
Statement
Let be a graph. A connected -factor is a connected spanning subgraph of in which every vertex has degree either or . Connected -factor conjecture. Every -tough graph of order at least three admits a connected -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.