Prove that every graph is a minor of a bipartite graph.

74 Views Asked by At

I am stuck on this problem and need help figuring it out. Here are some of my thoughts:

  1. A bipartite graph contains no odd cycle.
  2. Every n odd cycle is a minor of n+1 even cycle.
1

There are 1 best solutions below

0
On BEST ANSWER

Here are some hints:

Let $G$ be a graph on $n$ vertices. We want to show that it is a minor of some bipartite graph. To this end, consider $K_{n,n}$. $K_{n,n}$ contains $K_n$ as a minor (why?), and as $K_n$ contains $G$ as a minor (why?), $K_{n,n}$ contains $G$ as a minor (why?).