ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk and dd be positive integers. For a graph GG, call it (k,d)(k,d)-sparse if every subgraph HH satisfies

(k+1)(k+d)v(H)−(k+d+1)e(H)−k2≥0.(k+1)(k+d)v(H)-(k+d+1)e(H)-k^2\geq 0.

Call a subgraph HH (k+1)(k+1)-overfull if e(H)>(k+1)(v(H)−1)e(H)>(k+1)(v(H)-1). Sparse Strong Nine Dragon Tree Conjecture. Every (k,d)(k,d)-sparse graph with no (k+1)(k+1)-overfull subgraph decomposes into k+1k+1 forests such that one forest has every component containing at most dd edges.

This conjecture strengthens the paper’s main theorem, which proves the assertion when d≤2(k+1)d\leq 2(k+1). It is motivated by the fact that (k,d)(k,d)-sparsity is a relaxed form of the fractional-arboricity inequality, while excluding overfull subgraphs ensures decomposition into k+1k+1 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 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.