On ordered graphs and graph orderings (Q1329810)
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: On ordered graphs and graph orderings |
scientific article; zbMATH DE number 612436
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On ordered graphs and graph orderings |
scientific article; zbMATH DE number 612436 |
Statements
On ordered graphs and graph orderings (English)
0 references
31 July 1994
0 references
The main result of this paper is: For every oriented graph \(\vec G\) with in-degree for every vertex at least 2 there is no graph \(H\) such that every strong orientation \(\vec H\) of \(H\) contains a copy of \(\vec G\). This disproves a conjecture of \textit{M. Cochand} and \textit{P. Duchet} [Algorithms Comb. 8, 39-46 (1989; Zbl 0698.05055)]. The author also discusses the relationship of the above result and similar results with Ramsey theory.
0 references
ordered graphs
0 references
graph orderings
0 references
oriented graph
0 references
strong orientation
0 references
Ramsey theory
0 references
