IMOC 2019 C4
Source: https://drive.google.com/file/d/1OzcOBEZZMCgCeiDLLjyRbK0KkwN4207F/view
December 24, 2019
combinatoricsIMOC
Problem Statement
Determine the largest such that for all competitive graph with points, if the difference between in-degree and out-degree of any point is less than or equal to , then this graph is strongly connected.