MathDB
Miklos Schweitzer 1974_2

Source:

November 12, 2008
combinatorics proposedcombinatoricsgraph theory

Problem Statement

Let G G be a 2 2-connected nonbipartite graph on 2n 2n vertices. Show that the vertex set of G G can be split into two classes of n n elements such that the edges joining the two classes form a connected, spanning subgraph. L. Lovasz
Back to ProblemsView on AoPS