On ordered graphs and graph orderings (Q1329810): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3475303 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4056030 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4088855 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4088856 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a Probabilistic Graph-Theoretical Method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3872505 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Ramsey-Type Theorem for Orderings of a Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4103570 / rank | |||
Normal rank |
Revision as of 17:09, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On ordered graphs and graph orderings |
scientific article |
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