A methodologically pure proof of a convex geometry problem

Victor Pambuccian

A methodologically pure proof of a convex geometry problem

Research output: Contribution to journal › Article › peer-review

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

Cite this

@article{e7b1e933710e405b8005586e28887c78,

title = "A methodologically pure proof of a convex geometry problem",

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.",

author = "Victor Pambuccian",

year = "2001",

month = dec,

day = "1",

language = "English (US)",

volume = "42",

pages = "401--406",

journal = "Beitrage zur Algebra und Geometrie",

issn = "0138-4821",

publisher = "Springer Berlin",

number = "2",

}

TY - JOUR

T1 - A methodologically pure proof of a convex geometry problem

AU - Pambuccian, Victor

PY - 2001/12/1

Y1 - 2001/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33846784245&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33846784245&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33846784245

SN - 0138-4821

VL - 42

SP - 401

EP - 406

JO - Beitrage zur Algebra und Geometrie

JF - Beitrage zur Algebra und Geometrie

IS - 2

ER -

A methodologically pure proof of a convex geometry problem

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this