Skip to content / Đến nội dung
ThichHocToan.com

MathNet 2013 Question 89

Math Olympiad Vault · MathNet 2013

Question 89

Some cities of a country consisting of $n$ cities are connected by round trip flights so that there are at least $k$ flights from any city and any city is reachable from any city. Prove that for any such flight organization these flights can be distributed among $n-k$ air companies so that one can reach any city from any city by using at most one flight of each air company.