C(S0,5) Subgraph Decider

Determines if a graph embeds as an induced subgraph in the curve graph of the 5-punctured sphere. By the Aougab–Biringer–Gaster theorem, since the complexity is ξ(S0,5) = 2, the graph must be simple and strictly triangle-free.