
doi: 10.1007/bf00418651
An angle order is a partially ordered set whose points can be mapped into unbounded angular regions in the plane such that \(x\) is less than \(y\) in the partial order if and only if \(x\)'s angular region is properly included in \(y\)'s. The zero augmentation of a partially ordered set adds one point to the set that is less than all original points. The authors define special angle orders \(\Gamma_ n\) where the vertices of the angles are related to a fixed circular disk and \(2n\) equidistant points on it. Then they prove that the zero augmentation of \(\Gamma_ n\) is not an angle order when \(n\) is even and sufficiently large. The difficult proof makes extensive use of Ramsey theory. With this result a problem of the authors [ibid. 1, 333-343 (1985; Zbl 0558.06003] is solved.
Combinatorics of partially ordered sets, geometric representation of posets, Ramsey theory, zero augmentation, Erdős problems and related topics of discrete geometry, angle order
Combinatorics of partially ordered sets, geometric representation of posets, Ramsey theory, zero augmentation, Erdős problems and related topics of discrete geometry, angle order
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
