Archive

Posts Tagged ‘helly’

Applications of Helly’s theorem

March 12, 2023 Leave a comment
  1. Prove that if the plane can be covered with n \geq 3 half planes then there exist three of these which also cover the plane.
  2. On a circle consider a finite set of arcs which do not cover the circle, such that any two of them have non-void intersection. Show that all arcs have a common points. If the arcs cover the circle does the conclusion still hold?
  3. Consider n \geq 3 half circles which cover the whole circle. Show that we can pick three of them which still cover the circle.

I’ll not provide the solutions for now. The title should be a strong indication towards finding a solution!

Helly’s Theorem

March 10, 2023 Leave a comment

Helly’s theorem. Let {n\geq 4} convex figures be given in the plane and suppose each three of them have a common point. Prove that all {n} figures have a common point.

Can the convexity hypothesis be removed? 

Read more…

Halfplanes cover

November 6, 2010 Leave a comment

Suppose that the plane can be covered by n half-planes. Then we can find three of these half-planes which cover the plane.
Read more…

Categories: Uncategorized Tags:

Helly -> Centring -> Blaschke

August 28, 2010 Leave a comment

Prove that if a finite collection of convex sets in the plane has the property that every three sets from the collection have a point in common, then they all have a point in common. Prove that this holds for an infinite collection also if the sets from the given collection are bounded.

Consider a closed convex figure in plane. Prove that we can find an interior point O such that for any chord PQ of the figure passing through O we have PO,OQ >\displaystyle \frac{1}{3}PQ.

The breadth of a closed convex curve in a given direction is the distance oh the two parallel lines of the given direction which enclose the given curve. The width of a curve the minimum value of the breadth as the direction varies. Prove that a convex curve of width 1 contains a circle of radius 1/3, and this is the best value possible.
Reference: J.H Cadwell, Topics in Recreational Mathematics
Read more…

Rectangles in the plane

November 18, 2009 Leave a comment

We consider a finite family of rectangles in plane, having edges parallel with the coordinate axes such that for any pair of rectangles there exists a vertical line, or a horizontal one which intersects both rectangles. Prove that there exists a vertical line and a horizontal one such that any of the given rectangles intersects at least one of them.

Read more…