We consider the following analogue of a problem of Turán for interval graphs: Let c = c(n, m) be the largest integer such that any interval graph with n vertices and at least m edges contains a complete subgraph on c vertices. We determine the value of c(n, m) explicitly.
