Paths with two blocks in \(n\)-chromatic digraphs (Q885298)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5162681
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Paths with two blocks in \(n\)-chromatic digraphs |
scientific article; zbMATH DE number 5162681 |
Statements
Paths with two blocks in \(n\)-chromatic digraphs (English)
0 references
8 June 2007
0 references
Let \(k+l=n-1 \geq 3\) and let \(D\) be an \(n\)-chromatic digraph. Proving a conjecture of El-Sahili, the authors show that \(D\) contains a \(P(k,l).\) (Here \(P(k,l)\) is an oriented path of order \(k+l+1\) starting with \(k\) forward arcs and followed by \(l\) backward arcs for some \(k \geq 1\) and \(l\geq 1.\)) Several connections to related results and open problems are mentioned.
0 references
universal digraph
0 references
unavoidable digraph
0 references
\(n\)-chromatic digraph
0 references
oriented path
0 references
0 references
0.902786135673523
0 references
0.8433544635772705
0 references
0.7974540591239929
0 references
