<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose edge set is [(1,2),(1,3),(2,3),(2,4),(3,5),(4,5),(4,6)], and a matching represented by the dictionary {1:2, 3:5, 4:6}, use NetworkX to determine if the matching is a perfect matching for the graph.
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()
G.add_edges_from([(1,2),(1,3),(2,3),(2,4),(3,5),(4,5),(4,6)])

# Define a matching dictionary
my_match = {1:2, 3:5, 4:6}

# Determine if the matching is a perfect matching
is_perfect = nx.is_perfect_matching(G, my_match)

print('Is it a perfect matching?', is_perfect)
<|EOT|>
