TOT 386 1993 Autumn A J4 diagonals of 1x1 in 8x8 table
Source:
June 12, 2024
combinatorics
Problem Statement
Diagonals of a by square are arranged in an by table (one in each by square). Consider the union of all diagonals drawn. The set consists of several connected pieces (two points belong to the same piece if and only if W contains a path between them). Can the number of the pieces be greater than
(a) ,
(b) ? (NB Vassiliev)