Minimal feedback arc sets and long paths
Statement
Conjecture 6. 2 9. (Lichiardopol's Conjecture) Every digraph D has some minimal feedback arc set F which contains a path of length δ+
D.
10 Notes: This implies Ho´ ang & Reed (6.20), Caccetta-H¨ aggkvist (2.1), Bermond-Thomassen (6.19), and Thomass´ e (6.34).
Record
- Source
- Added
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.