Directed graph with 2013 vertices
Source: Turkey JBMO Team Selection Test 2013, P8
May 31, 2013
combinatorics proposedcombinatorics
Problem Statement
In a directed graph with vertices, there is exactly one edge between any two vertices and for every vertex there exists an edge outwards this vertex. We know that whatever the arrangement of the edges, from every vertex we can reach vertices using at most two edges. Find the maximum value of .