The universality problem for C-free graphs

For which finite sets C of graphs does the class of C-free countable graphs have a universal member under strong embeddings?

Open the “Model theory and formal languages” section on Wikipedia →

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