Let denote the graph obtained from by adding all edges between the three vertices of degree in it. We prove that for each and , each -vertex graph with has a -minor. The bound is sharp in the sense that for every , there are infinitely many graphs with that have no -minor. The result confirms a partial case of the conjecture by Woodall and Seymour that every -chromatic graph has a -minor.