The cycle structure of regular multipartite tournaments
type: Item
instance of: scholarly article
title: The cycle structure of regular multipartite tournaments
zbMATH Open document ID: 1004.05035
DOI: 10.1016/S0166-218X(01)00285-2
author: Yubao Guo
author: Jin Ho Kwak
published in: Discrete Applied Mathematics
publication date: 2002-08-29T00:00:00Z
review text: A multipartite tournament is an orientation of a complete graph. A digraph is regular if the indegree and outdegree of every vertex equal the same constant. B. Alspach proved that every arc of a regular tournament is contained in a cycle of length \(n\) for \(n\in \{3,4,\dots, p\}\), where \(p\) is the order of the tournament. The authors prove an interesting extension of this theorem.
reviewed by: G. Gutin
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1792317
zbMATH Keywords: digraphs
zbMATH Keywords: multipartite tournament
zbMATH Keywords: cycles
zbMATH Keywords: regularity
MaRDI profile type: Publication
cites work: Cycles of Each Length in Regular Tournaments
cites work: Diconnected Orientations and a Conjecture of Las Vergnas
cites work: On multipartite tournaments
cites work: Q4873829
cites work: Cycles in multipartite tournaments
cites work: On cycles in multipartite tournaments
cites work: Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
cites work: On Subtournaments of a Tournament
cites work: Kings in semicomplete multipartite digraphs
full work available at URL: s0166-218x(01)00285-2
OpenAlex ID: W2002465963
description: scientific article; zbMATH DE number 1792317