Skip Navigation

Journal of the London Mathematical Society 1992 s2-45(2):314-320; doi:10.1112/jlms/s2-45.2.314
© 1992 by London Mathematical Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bárány, I.
Right arrow Articles by Larman, D. G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© Oxford University Press

A Colored Version of Tverberg's Theorem

I. Bárány and D. G. Larman

Department of Operations Research and Cowles Foundation Yale University New Haven Connecticut 06520 USA
Department of Mathematics University College London Gower Street London WC1E 6BT

The main result of this paper is that given r red, r white, and r green points in the plane, it is possible to form r vertex-disjoint triangles {delta}i,...,{delta}r in such a way that {delta}i has one red, one white, and one green vertex for every i = l,...,r and the intersection of these triangles is non-empty.

On leave from: Mathematical Institute Hungarian Academy of Sciences PO Box 127 1364 Budapest Hungary


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.