Equitable induced-forest partition conjecture for bounded-degree graphs
Statement
Let be a graph with maximum degree . An equitable partition is a partition of the vertex set into parts whose sizes differ by at most one, and an induced forest is a vertex-induced subgraph that is a forest. Equitable induced-forest partition conjecture. For any integers and , every graph of maximum degree can be equitably partitioned into induced forests. The provided excerpt does not state whether this conjecture has been resolved, so its status remains open 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.