This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 1

2010 Miklós Schweitzer, 2
Let $ G $ be a countably infinite, $ d $ -regular, connected, vertex-transitive graph. Show that there is a complete pairing in $ G $.
pairing graph combinatorics