We show that universal Lyndon words exist for every n and exhibit combinatorial and structural properties of these words.
