Notes on cycles through a vertex or an arc in regular 3-partite tournaments (Q427703)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Notes on cycles through a vertex or an arc in regular 3-partite tournaments |
scientific article; zbMATH DE number 6046359
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Notes on cycles through a vertex or an arc in regular 3-partite tournaments |
scientific article; zbMATH DE number 6046359 |
Statements
Notes on cycles through a vertex or an arc in regular 3-partite tournaments (English)
0 references
14 June 2012
0 references
The purpose of this note is to show that if a digraph is an r-regular 3-partite tournament with \(r\) greater than \(1\), then every vertex of the digraph is contained in a 6-cycle and every arc of the digraph is contained in a 5- or 6-cycle.
0 references
cycle
0 references
r-regular
0 references
3-partite
0 references
k-cycle
0 references
tournament
0 references
0.9253431
0 references
0.9253431
0 references
0.9117441
0 references
0.9117433
0 references
0.9033855
0 references
