Abstract
A geometric permutation is the pair of permutations formed by a common transversal for a finite family of disjoint convex sets in the plane. It is shown that if A is a family of n convex and pairwise disjoint segments in the plane then the number of geometric permutations formed by all common transversals of A cannot be more than n.
| Original language | English |
|---|---|
| Pages (from-to) | 271-284 |
| Number of pages | 14 |
| Journal | Discrete Mathematics |
| Volume | 54 |
| Issue number | 3 |
| DOIs | |
| State | Published - May 1985 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
Fingerprint
Dive into the research topics of 'Geometric permutations for convex sets'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver