<｜begin▁of▁sentence｜>### Instruction:
As a Youth Counselor, imagine you are working with a group of six young students who are collaborating on a project. They are using a network modeling tool called Erdős–Rényi to represent their interactions, and the graph generated has 9 edges. Now, they need help in identifying all the different groups of students who can work independently from each other within this network. Can you use the maximal_independent_vertex_sets function in igraph to find all the maximal independent vertex sets in the graph, and help the students identify the various independent groups for efficient collaboration?
### Response:
from igraph import Graph

# Sample graph creation
g = Graph.Erdos_Renyi(n=6, m=9)

# Find the maximal independent vertex sets of the graph
maximal_ivs = g.maximal_independent_vertex_sets()

# Display the results
print('Maximal Independent Vertex Sets:', maximal_ivs)
<|EOT|>
