Iran TST 2006, D2, P3

For discussing Olympiad Level Combinatorics problems
tanmoy
Posts:312
Joined:Fri Oct 18, 2013 11:56 pm
Location:Rangpur,Bangladesh
Iran TST 2006, D2, P3

Unread post by tanmoy » Wed Dec 28, 2016 7:21 pm

Let $G$ be a tournoment such that it's edges are colored either red or blue.
Prove that there exists a vertex of $G$ like $v$ with the property that, for every other vertex $u$ there is a mono-color directed path from $v$ to $u$.
"Questions we can't answer are far better than answers we can't question"

Post Reply