MathDB

2

Part of 2010 Miklós Schweitzer

Problems(1)

D-regular ,vertex-transitive graph

Source: Miklós Schweitzer 2010, P2

9/9/2020
Let G G be a countably infinite, d d -regular, connected, vertex-transitive graph. Show that there is a complete pairing in G G .
graphpairing