The feedback vertex set conjecture
The feedback vertex set conjecture
For any integer , let be the supremum of over all orgraphs with maximum degree at most , where denotes the minimum feedback vertex set size. The conjecture.
The paper has already established the corresponding exact values for and , while the value at 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
Sign in to submit a solution.
No solutions have been posted yet.