Are there any graphs on n vertices whose representation requires more than floor(n/2) copies of each letter?

Open the “Word-representation of graphs” section on Wikipedia →

Source: List of unsolved problems in mathematics (CC BY-SA 4.0)