Splitting into pathes with minimum length
Source: Iranian third round 2019 finals Combinatorics exam problem 1
August 27, 2019
combinatorics
Problem Statement
A bear is in the center of the left down corner of a square .we call a cycle in this grid a bear cycle if it visits each square exactly ones and gets back to the place it started.Removing a row or column with compose the bear cycle into number of pathes.Find the minimum so that in any bear cycle we can remove a row or column so that the maximum length of the remaining pathes is at most .