Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments (Q1827718)
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: Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments |
scientific article; zbMATH DE number 2083675
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments |
scientific article; zbMATH DE number 2083675 |
Statements
Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments (English)
0 references
6 August 2004
0 references
A multipartite tournament is an orientation of a complete multipartite graph. The authors prove a sufficient condition for a multipartite tournament to contain a Hamiltom path starting with a given path. As a corollary, they show that every arc of a regular multipartite tournament is contained in a Hamilton path. They conjecture that every arc of a regular \(c\)-partite tournament is contained in a Hamilton cycle for each \(c\geq 4.\)
0 references
multipartite tournament
0 references
Hamilton path
0 references
regular
0 references
0 references
0 references
0 references
