Polygonal graphs as ordered sets: the Sperner criterion (Q2830940)
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 6646243
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polygonal graphs as ordered sets: the Sperner criterion |
scientific article; zbMATH DE number 6646243 |
Statements
1 November 2016
0 references
partially ordered set
0 references
Sperner property
0 references
polygonal graph
0 references
path
0 references
zigzag
0 references
Polygonal graphs as ordered sets: the Sperner criterion (English)
0 references
0.7915268540382385
0 references
0.7546567916870117
0 references
