Does there exist a conference graph for every number of vertices v>1 where v \equiv 1 \bmod 4 and v is an odd sum of two squares?

Open the “Restriction of graph parameters” section on Wikipedia →

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