OIM 2007 Problem 6
Let be a family of hexagons satisfying the following properties:
i) has parallel opposite sides.
ii) Any 3 vertices of can be covered with a strip of width 1.
Determine the least such that every hexagon belonging to can be covered with a strip of width .
Note: A strip is the area bounded by two parallel lines separated by a distance . The lines belong to the strip, too.
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.