Consider n red and n blue points in the plane, no three of them being collinear. Prove that one can connect each red point to a blue one with a segment such that no two segments intersect.


Question and Answers Forum

All Questions Topic List
Logic Questions
Previous in All Question Next in All Question
Previous in Logic Next in Logic
Question Number 13891 by Tinkutara last updated on 24/May/17

$Consider n red and n blue points in$ $the plane, no three of them being collinear .$ $Prove that one can connect each red$ $point to a blue one with a segment$ $such that no two segments intersect .$
Commented by mrW1 last updated on 25/May/17

$W h e n I i m a g e t h a t t h e s e s e g m e n t s$ $w e r e m a t c h e s o f d i f f e r e n t l e n g t h$ $a n d t h e r e d p o i n t s w e r e t h e h e a d s o f$ $t h e m a t c h e s, I k n o w i t i s a l w a y s$ $p o s s i b l e t o p l a c e t h e m a t c h e s o n a$ $t a b l e s u c h t h a t t h e y {d o n}^{'} t l i e o v e r e a c h$ $o t h e r .$
Terms of Service
Privacy Policy
Contact: info@tinkutara.com

Question and Answers Forum