Conditions on the regularity of balanced c-partite tournaments for the existence of strong subtournaments with high minimum degree

MaRDI QIDQ5080927zbMATH OpenFDO

Authors Juan José Montellano-Ballesteros, M. Olsen, A. P. Figueroa

Publication date 31 May 2022

Full work available at URL https://arxiv.org/abs/2010.09835, http://ajc.maths.uq.edu.au/pdf/82/ajc_v82_p353.pdf

zbMATH Keywords

pathsconnectivitycyclespancyclicitycomplementary cyclesmultipartite tournamentsHamiltonian cycles and paths

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)

Abstract: We consider the following problem posed by Volkmann in 2007: How close to regular must a c-partite tournament be, to secure a strongly connected subtournament of order $c$? We give sufficient conditions on the regularity of balanced $c$-partite tournaments to assure the existence of strong maximal subtournament with minimum degree at least $leftlfloorfracc-24ightfloor+1$. We obtain this result as an application of counting the number of subtournaments of order $c$ for which a vertex has minimum out-degree (resp. in-degree) at most $qgeq0$.

Recommendations

• Strong subtournaments and cycles of multipartite tournaments
• Strong subtournaments of order \(c\) containing a given vertex in regular \(c\)-partite tournaments with \(c\geq 16\)
• Strong subtournaments containing a given vertex in regular multipartite tournaments
• Partition of regular balanced \(c\)-tournaments into strongly connected \(c\)-tournaments
• scientific article; zbMATH DE number 2104714

Cites work

• scientific article; zbMATH DE number 1355287 (Why is no real title available?)
• scientific article; zbMATH DE number 1498519 (Why is no real title available?)
• Almost regular c-partite tournaments contain a strong subtournament of order c when c 5
• Multipartite tournaments: a survey
• Strong subtournaments and cycles of multipartite tournaments
• Strong subtournaments of order \(c\) containing a given vertex in regular \(c\)-partite tournaments with \(c\geq 16\)

Cited in

(3)

• scientific article; zbMATH DE number 2104714 (Why is no real title available?)
• Strong subtournaments of order \(c\) containing a given vertex in regular \(c\)-partite tournaments with \(c\geq 16\)
• Partition of regular balanced \(c\)-tournaments into strongly connected \(c\)-tournaments

This page was built for publication: Conditions on the regularity of balanced \(c\)-partite tournaments for the existence of strong subtournaments with high minimum degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080927)