Graph TheoryHardIsomorphism and Subgraphs
Isomorphism and Subgraphs · Hard problem
Let have vertices . Remove the perfect matching from . How many triangles does the resulting graph contain?
Let have vertices . Remove the perfect matching from . How many triangles does the resulting graph contain?