The f(6)f(6) feedback vertex set conjecture

For any integer k2k\ge 2, let f(k)f(k) be the supremum of fvs(D)/V(D){\rm fvs}(D)/|V(D)| over all orgraphs DD with maximum degree at most kk, where fvs(D){\rm fvs}(D) denotes the minimum feedback vertex set size. The f(6)f(6) conjecture.

f(6)=47.f(6)=\frac{4}{7}.

The paper has already established the corresponding exact values for f(4)f(4) and f(5)f(5), while the value at k=6k=6 is proposed as the next case and remains open in the supplied text.

Sources & referencesView supporting material

Primary source

Jiangdong Ai, Gregory Gutin, Xiangzhou Liu, Anders Yeo and Yacong Zhou, “Feedback vertex sets of digraphs with bounded maximum degree”, arXiv:2512.01676 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.