Proof Writing & Problem Solving · Superchallenge problem

The numbers $1, 2, \ldots, 10$ are placed around a circle in some order. What is the largest number $k$ such that, whatever the order, some three neighbouring numbers (three in a row around the circle) have sum at least $k$?