- Tytuł:
- On the Number of Disjoint 4-Cycles in Regular Tournaments
- Autorzy:
-
Ma, Fuhong
Yan, Jin - Powiązania:
- https://bibliotekanauki.pl/articles/31342321.pdf
- Data publikacji:
- 2018-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
regular tournament
C 4 -free
disjoint cycles - Opis:
- In this paper, we prove that for an integer $ r \ge 1 $, every regular tournament $T$ of degree $ 3r − 1 $ contains at least \( \tfrac{21}{16} r- \tfrac{10}{3} \) disjoint directed 4-cycles. Our result is an improvement of Lichiardopol’s theorem when taking $ q = 4 $ [Discrete Math. 310 (2010) 2567–2570]: for given integers $ q \ge 3 $ and $ r \ge 1 $, a tournament $T$ with minimum out-degree and in-degree both at least $ (q − 1)r − 1 $ contains at least $r$ disjoint directed cycles of length $q$.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2018, 38, 2; 491-498
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł