MathDB
Planner graphs

Source: Iranian third round 2019 mid term combinatorics exam problem 1

July 27, 2019
combinatorics

Problem Statement

Hossna is playing with a māˆ—nm*n grid of points.In each turn she draws segments between points with the following conditions.
**1.** No two segments intersect.
**2.** Each segment is drawn between two consecutive rows.
**3.** There is at most one segment between any two points.
Find the maximum number of regions Hossna can create.