Number of 4-kings in bipartite tournaments with no 3-kings (Q1918562): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4692391 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On multipartite tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The radii of n-partite tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Kings in multipartite tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Kings in bipartite tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Kings in \(k\)-partite tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Every vertex a king / rank | |||
Normal rank |
Revision as of 12:31, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Number of 4-kings in bipartite tournaments with no 3-kings |
scientific article |
Statements
Number of 4-kings in bipartite tournaments with no 3-kings (English)
0 references
18 July 1996
0 references
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.
0 references
rings
0 references
distance
0 references
bipartite tournament
0 references