M HYPE SPLASH
// news

How many subgraphs isomorphic to P2 are in Km,n

By Michael Henderson
$\begingroup$

How many subgraphs isomorphic to P2 are in Km,n?

Right now I'm thinking this problem may be either n(m-1) or m(n-1) but I'm not sure how else to think of it. Any help on this would be greatly appreciated.

$\endgroup$ 5 Reset to default

Know someone who can answer? Share a link to this question via email, Twitter, or Facebook.

Your Answer

Sign up or log in

Sign up using Google Sign up using Facebook Sign up using Email and Password

Post as a guest

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy