Abstract. As opposded to famous degree/diameter problem, for given d and k we determine the smallest order of a vertex-transitive graph of degree d and diameter k. Moreover, we prove that extremal graphs can be found among Cayley graphs.