Inevitable intersections

Janos Pach

Courant Institute of Mathematical Sciences

April 13,
refreshments at 3:45pm


The following problem was raised by M. Watanabe. Let $P$ be a self-intersecting 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(at-sign)

Return to seminar home page

Combinatorics Seminar, Mathematics Department, MIT, sara(at-sign)

Page loaded on March 24, 2001 at 08:51 PM. Copyright © 1998-99, Sara C. Billey. All rights reserved.