Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic (Q5957756): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:49, 5 March 2024
scientific article; zbMATH DE number 1719011
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic |
scientific article; zbMATH DE number 1719011 |
Statements
Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic (English)
0 references
25 September 2002
0 references
For a digraph \(D\), a semidegree of a vertex \(x\) is its indegree or outdegree. The minimum (maximum) semidegree of \(D\) is denoted by \(\delta (\Delta)\). \(D\) is almost regular if \(\Delta-\delta\leq 1\). It is proved that all, except possibly a finite number, almost regular \(c\)-partite tournaments are vertext pancyclic when \(c\geq 5\).
0 references
cycles
0 references
digraph
0 references
tournaments
0 references
pancyclic
0 references
