Two disjoint cycles in digraphs
[ 1 ] Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | [ S ] student
2023
artykuł naukowy
angielski
- cycles
- digraphs
- extremal graph theory
EN Bermond and Thomassen conjectured that every digraph with minimum outdegree at least 2k− 1 contains k vertex disjoint cycles. So far the conjecture was verified for k ⩽ 3. Here we generalise the question asking for all outdegree sequences which force k vertex disjoint cycles and give the full answer for k ⩽ 2.
23.04.2023
461 - 469
140
0,9