2020/10/19 by Ana Paulina Figueroa, Figueroa, Ana Paulina, Juan José Montellano‐Ballesteros +3
Computer Science · Mathematics · #05C20 #05C35 #Advanced Optimization Algorithms Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #Polynomial and algebraic computation
paper · pdf · doi:10.48550/arxiv.2010.09835
openalex publication_date 2020/10/19 · openalex created_date 2020/10/29 · openalex updated_date 2026/07/28
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 \lfloor (c-2)/(4)\rfloor+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 q≥ 0.