<｜begin▁of▁sentence｜>### Instruction:
Given a graph with the edges defined as [(0, 1), (0, 2), (1, 2), (2, 3), (3, 4), (4, 5), (3, 5)], can you use the is_minimal_separator function to determine if removing the vertices [2, 3] results in a disconnected graph without creating a smaller separator by removing any subset of these vertices?
### Response:
from igraph import Graph

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

# Check if a given set of vertices is a minimal separator
g.is_minimal_separator([2, 3])
<|EOT|>
