Highly linked tournaments with large minimum out-degree

Bang-Jensen, 1989, On the 2-linkage problem for semicomplete digraphs, Ann. Discrete Math., 41, 23, 10.1016/S0167-5060(08)70447-3 Bollobás, 1996, Highly linked graphs, Combinatorica, 16, 313, 10.1007/BF01261316 F. Havet, B. Lidický, Splitting a tournament into two subtournaments with given minimum outdegree, Preprint, 2014, 15 pp. Jung, 1970, Verallgemeinerung des n-fachen zusammenhangs für graphen, Math. Ann., 187, 95, 10.1007/BF01350174 Kühn, 2014, Proof of a conjecture of Thomassen on hamilton cycles in highly connected tournaments, Proc. Lond. Math. Soc., 109, 733, 10.1112/plms/pdu019 Larman, 1974, On the existence of certain configurations within graphs and the 1-skeletons of polytopes, Proc. Lond. Math. Soc., 20, 144 Lichiardopol, 2012, Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz, Int. J. Comb., 2012 Mader, 1967, Homomorphieeigenschaften und mittlere Kantendichte von Graphen, Math. Ann., 174, 265, 10.1007/BF01364272 Mader, 1985, Degree and local connectivity in digraphs, Combinatorica, 5, 161, 10.1007/BF02579379 Pokrovskiy, 2015, Highly linked tournaments, J. Combin. Theory Ser. B, 115, 339, 10.1016/j.jctb.2015.05.005 Thomas, 2005, An improved extremal function for graph linkages, European J. Combin., 26, 309, 10.1016/j.ejc.2004.02.013 Thomassen, 1984, Connectivity in tournaments, 305 Thomassen, 1985, Even cycles in directed graphs, European J. Combin., 6, 85, 10.1016/S0195-6698(85)80025-1 Thomassen, 1991, Note on highly connected non-2-linked digraphs, Combinatorica, 11, 393, 10.1007/BF01275674