### Abstract

We prove, using the minimalist axiom system for convex geometry proposed by W. A. Coppel, that, given n red and n blue points, such that no three are collinear, one can pair each of the red points with a blue point such that the n segments which have these paired points as endpoints are disjoint.

Original language | English (US) |
---|---|

Pages (from-to) | 401-406 |

Number of pages | 6 |

Journal | Beitrage zur Algebra und Geometrie |

Volume | 42 |

Issue number | 2 |

State | Published - Dec 1 2001 |

### ASJC Scopus subject areas

- Algebra and Number Theory
- Geometry and Topology

## Fingerprint Dive into the research topics of 'A methodologically pure proof of a convex geometry problem'. Together they form a unique fingerprint.

## Cite this

Pambuccian, V. (2001). A methodologically pure proof of a convex geometry problem.

*Beitrage zur Algebra und Geometrie*,*42*(2), 401-406.