Gaokui Xu, Shengjia Li
Abstract
In this paper,we study the strong subtournaments in regular multipartite tournaments and prove that each vertex of a regular multipartite tournament with c≥6 partite sets is contained in a strong subtournament of order p for every p∈{3,4,…,c- 3}.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper,we study the strong subtournaments in regular multipartite tournaments and prove that each vertex of a regular multipartite tournament with c≥6 partite sets is contained in a strong subtournament of order p for every p∈{3,4,…,c- 3}.
Key concepts: Multipartite, Tournament, Vertex (graph theory), Mathematics, Combinatorics, Discrete mathematics, Graph, Physics