The sparse Strong Nine Dragon Tree Conjecture
Statement
Let and be positive integers. For a graph , call it -sparse if every subgraph satisfies
Call a subgraph -overfull if . Sparse Strong Nine Dragon Tree Conjecture. Every -sparse graph with no -overfull subgraph decomposes into forests such that one forest has every component containing at most edges.
This conjecture strengthens the paper’s main theorem, which proves the assertion when . It is motivated by the fact that -sparsity is a relaxed form of the fractional-arboricity inequality, while excluding overfull subgraphs ensures decomposition into forests.
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.