Number of 4-kings in bipartite tournaments with no 3-kings (Q1918562): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q126975323, #quickstatements; #temporary_batch_1721943449312 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(95)00051-w / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2063267032 / rank | |||
Normal rank | |||
Latest revision as of 09:24, 30 July 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
