Vertex-disjoint cycles in bipartite tournaments

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F15%3A43925217" target="_blank" >RIV/49777513:23520/15:43925217 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.disc.2015.02.012" target="_blank" >http://dx.doi.org/10.1016/j.disc.2015.02.012</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.disc.2015.02.012" target="_blank" >10.1016/j.disc.2015.02.012</a>

Result language
angličtina
Original language name
Vertex-disjoint cycles in bipartite tournaments
Original language description
Let t1, . . . , tr ELEMENT OF [4, 2q] be any r even integers. In this note, we show that every bipartite tournament with minimum outdegree at least qrMINUS SIGN 1 contains r vertex-disjoint directed cycles of lengths s1 , . . . , sr such that si=ti for ti = 0 (mod 4) and si ELEMENT OF {ti, ti+2} for ti=2 (mod 4), where 1 LESS-THAN OR EQUAL TO i LESS-THAN OR EQUAL TO r. The special case q = 2 of the result verifies the bipartite tournament case of a conjecture proposed by Bermond and Thomassen.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/EE2.3.30.0038" target="_blank" >EE2.3.30.0038: New excellence in human resources</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)