ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with maximum degree Δ\Delta. 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 Δ\Delta and k⩾⌈Δ+12⌉k\geqslant\left\lceil\frac{\Delta+1}{2}\right\rceil, every graph of maximum degree Δ\Delta can be equitably partitioned into kk 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 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.