Number of 4-kings in bipartite tournaments with no 3-kings
type: Item
instance of: scholarly article
title: Number of 4-kings in bipartite tournaments with no 3-kings
zbMATH Open document ID: 0851.05053
DOI: 10.1016/0012-365X(95)00051-W
author: B. P. Tan
author: K. M. Koh
published in: Discrete Mathematics
publication date: 1996-07-18T00:00:00Z
review text: If \(T\) is an oriented graph, let \(k_j(T)\) denote the number of nodes \(u\) of \(T\) such that the distance from \(u\) to any other node of \(T\) is at most \(j\). The authors show that if \(T\) is a bipartite tournament such that \(T\) has no nodes of in-degree zero and \(k_3(T)= 0\), then \(k_4(T)\geq 8\); and they characterize the tournaments for which equality holds.
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 906911
zbMATH Keywords: rings
zbMATH Keywords: distance
zbMATH Keywords: bipartite tournament
reviewed by: J. W. Moon
MaRDI profile type: Publication
cites work: Q4692391
cites work: On multipartite tournaments
cites work: The radii of n-partite tournaments
cites work: Kings in multipartite tournaments
cites work: Kings in bipartite tournaments
cites work: Kings in \(k\)-partite tournaments
cites work: Every vertex a king
Wikidata QID: Q126975323
full work available at URL: 0012-365x(95)00051-w
OpenAlex ID: W2063267032
Recommended article: On the 3-kings and 4-kings in multipartite tournaments
Recommended article: The number of kings in a multipartite tournament
Recommended article: Kings in bipartite tournaments
Recommended article: Kings in \(k\)-partite tournaments
Recommended article: Kings in bipartite hypertournaments
Recommended article: Kings in multipartite tournaments
Recommended article: Kings in Multipartite Tournaments And Hypertournaments
Recommended article: Q4834605
Recommended article: Kings in multipartite hypertournaments
Recommended article: 3-kings in 3-partite tournaments
description: scientific article; zbMATH DE number 906911