Vertex-Disjoint Subtournaments of Prescribed Minimum Outdegree or Minimum Semidegree: Proof for Tournaments of a Conjecture of Stiebi

<table>Minimum outdegree 2 minimal tournament <svg height="15.7" id="M283" style="vertical-align:-3.276pt" version="1.1" viewbox="0 0 17.775 15.7" width="17.775" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,0,0,-.017,.062,11.55)"><path d="M649 676l-22 -187l-33 -2q3 56 -12 94q-8 20 -31.5 26.5t-86.5 6.5h-74l-90 -491q-4 -23 -6 -36.5t1 -25t7 -16.5t18 -9t27 -5t41 -3l-6 -28h-286l4 28q68 5 84 18.5t28 76.5l94 491h-55q-74 0 -100.5 -6t-41.5 -23q-24 -29 -54 -98l-32 1q32 98 53 188h22q7 -18 15 -22
t37 -4h417q23 0 33.5 5t25.5 21h23z" id="x1D447"></path></g>
<g transform="matrix(.012,0,0,-.012,11.388,15.638)"><path d="M384 0h-275v27q67 5 81.5 18.5t14.5 68.5v385q0 38 -7.5 47.5t-40.5 10.5l-48 2v24q85 15 178 52v-521q0 -55 14.5 -68.5t82.5 -18.5v-27z" id="x31"></path></g>
</svg>.</table>

International Journal of Combinatorics

fig1

Figure 1

Figure 1: Vertex-Disjoint Subtournaments of Prescribed Minimum Outdegree or Minimum Semidegree: Proof for Tournaments of a Conjecture of Stiebi 