<｜begin▁of▁sentence｜>### Instruction:
Given a graph with the edge set [(0, 1), (0, 2), (0, 3), (1, 2), (1, 4), (2, 3)], can you use the maximal_cliques function to find all maximal cliques containing at least 2 vertices?
### Response:
from igraph import Graph

# Define your graph
edges = [(0, 1), (0, 2), (0, 3), (1, 2), (1, 4), (2, 3)]
g = Graph(edges)

# Find maximal cliques in the graph
max_cliques = g.maximal_cliques(min=2, max=0)

# Print max_cliques
print('Maximal Cliques:', max_cliques)
<|EOT|>
