Title
Two disjoint cycles in digraphs
Authors
[ 1 ] Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | [ S ] student
Year of publication
2023
Published in
Article type
scientific article
Publication language
english
Keywords
EN
- cycles
- digraphs
- extremal graph theory
Abstract
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.
Date of online publication
23.04.2023
Pages (from - to)
461 - 469
Ministry points / journal
140
Impact Factor
0,9
System created by Poznań University of Technology
and Poznan Supercomputing and Networking Center
Log in through eKonto to add to SIS