A note on arc-disjoint cycles in tournaments

• Autorzy: Jan Florek
• Języki publikacji: EN

Abstrakty

EN

We prove that every vertex v of a tournament T belongs to at least
$max{min{δ⁺(T), 2δ⁺(T) - d⁺_{T}(v) + 1}, min{δ¯(T), 2δ¯(T) - d¯_{T}(v) + 1}}$
arc-disjoint cycles, where δ⁺(T) (or δ¯(T)) is the minimum out-degree (resp. minimum in-degree) of T, and $d⁺_{T}(v)$ (or $d¯_{T}(v)$) is the out-degree (resp. in-degree) of v.

Kategorie tematyczne

• 05C35: Extremal problems
• 05C20: Directed graphs (digraphs), tournaments
• 05C38: Paths and cycles

• Wydawca: Institute of Mathematics Polish Academy of Sciences
• Czasopismo: Colloquium Mathematicum
• Rocznik: 2014
• Tom: 136
• Numer: 2
• Strony: 259-262

Daty

wydano

2014

Twórcy

autor

Jan Florek

• Institute of Mathematics and Cybernetics, University of Economics, Komandorska 118/120, 53-345 Wrocław, Poland

Identyfikatory

DOI

10.4064/cm136-2-7