Cycles of Well-Linked Sets I: an Elementary Bound for Directed Cycle Packing

arXiv:2404.19222v3 Announce Type: replace-cross Abstract: In 1996, Reed, Robertson, Seymour and Thomas [Combinatorica 1996] proved Younger's Conjecture, which states that, for all directed graphs $D$, there exists a function $f$ such that, if $D$ does not contain $k$ disjoint ...

🔗 Read more: https://arxiv.org/abs/2404.19222

#News #Software #Energy #Math #WorldNews #Policy #Academic