Permanent problem IDPPL 048
Graph theory
Let R(3;k) be the minimal n such that if the edges of K_n are coloured with k colours then there must exist a monochromatic triangle. Determine \lim_(k→ ∈fty)R(3;k)^(1/k).
Let R(3;k) be the minimal n such that if the edges of K_n are coloured with k colours then there must exist a monochromatic triangle. Determine \lim_(k→ ∈fty)R(3;k)^(1/k).
A solution must appear in a reputable journal, with documentation that Erdős offered the displayed amount. Claims are administered by the Combinatorics Foundation; erdosproblems.com does not pay awards.