MathDB
D-regular ,vertex-transitive graph

Source: Miklós Schweitzer 2010, P2

September 9, 2020
graphpairing

Problem Statement

Let G G be a countably infinite, d d -regular, connected, vertex-transitive graph. Show that there is a complete pairing in G G .
Back to ProblemsView on AoPS