Bang-Jensen–Bessy–Thomassé conjecture on cycles and girth
Bang-Jensen–Bessy–Thomassé conjecture on cycles and girth
Let and be positive integers, and let be the minimum integer such that every finite simple digraph of girth and minimum outdegree at least contains vertex-disjoint directed cycles. The circular digraph construction described in the source gives . Bang-Jensen–Bessy–Thomassé conjecture.
The conjecture is presented as a proposed strengthening in terms of girth, but this paper disproves it, so the conjecture is refuted.
Sources & referencesView supporting material
Primary source
Yandong Bai and Yannis Manoussakis, “On the number of vertex-disjoint cycles in digraphs”, arXiv:1805.02999 (2018).
Progress summary
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.