The toughness condition for connected {2,4}-factors
Statement
Let be a graph of order at least three, and write for the number of components of . A connected -factor is a connected spanning subgraph whose vertex degrees all belong to . The connected -factor conjecture. If
for every , then admits a connected -factor. The source states that this would simplify the preceding theorem, notes that it is true for strongly -tough graphs, and gives a restricted case in which it can be confirmed.
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.