Crooked diagrams with few slopes (Q1814184): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Jurek Czyzowicz / rank | |||
Property / author | |||
Property / author: Ivan Rival / rank | |||
Revision as of 00:48, 11 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Crooked diagrams with few slopes |
scientific article |
Statements
Crooked diagrams with few slopes (English)
0 references
25 June 1992
0 references
A natural and practical criterion in preparation of diagrams of ordered set is to minimize the number of different slopes used for the edges, i.e. at least the maximum number of upper covers and lower covers of any element. While this maximum degree is not always enough, it is shown that it is as long as any edge joining a covering pair may be bent to produce a crooked diagram.
0 references
diagrams
0 references
ordered set
0 references
slopes
0 references
covers
0 references
crooked diagram
0 references