Fundamentals of planar ordered sets (Q1086596): Difference between revisions
From MaRDI portal
Latest revision as of 10:59, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fundamentals of planar ordered sets |
scientific article |
Statements
Fundamentals of planar ordered sets (English)
0 references
1987
0 references
If it is possible to draw in a plane a (Hasse) diagram for a finite partially ordered set using non-intersecting arcs, then it is possible to draw it using only non-intersecting stright-line segments. Proofs are of topological and combinatorial nature, and are obtained working with directed graphs.
0 references
planar graphs
0 references
Hasse diagram
0 references
finite partially ordered set
0 references
