From a set of sets picking k disjoint sets

Question:From a set of sets picking k disjoint sets

Posted: vs140580 495 Product: Maple

September 07 2022

Let S be a set S={E1,E2,E3,E4,.....,Ek} where E1 is a set of edges, E2 is another set of edges etc.

that like E1={{1,2},{2,3},..}, E2={{3,4},{1,2},....} , now we need to pick all possible distinct sets of size L from the k sets of S such that the

{E1,E2,E3,....,EL} are mutually disjoint with each other in other.

Ei intersect Ej is null no edge in common for i not equal to j where i, j varies from 1 to L.

F is the function which takes to parameters set S and L.

F(S,L) then returns all possible sets which are such that {E1,E2,E3,....,EL} are mutually disjoint with each other in other.

Here mutually disjoint in graph theory terms they are edge-disjoint mutually

Share via:

E-Mail Address:
Password:
Remember Me:	Automatically sign in on future visits

E-Mail Address:
Password:
Remember Me:	Automatically sign in on future visits

Save this setting as your default sorting preference?
Note: You can change your preference any time in your account settings
Don't show this again