Inevitable intersections
Janos Pach
Courant Institute of Mathematical Sciences
April 13,
4:15pm
refreshments at 3:45pm
2338
ABSTRACT

The following problem was raised by M. Watanabe.
Let $P$ be a selfintersecting closed polygon with $n$
vertices in general position. How manys steps does it take
to disentangle $P$, i.e., to turn it into a simple polygon,
if in each step we can arbitrarily relocate one of its
vertices. Gabor Tardos and I can partially answer this
question. Our arguments are based on results about crossing
numbers of graphs.

Speaker's Contact Info: pach(atsign)cims.nyu.edu
Return to seminar home page
Page loaded on March 24, 2001 at 08:51 PM.

Copyright © 199899, Sara C. Billey.
All rights reserved.

