Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  present a short proof of the excluded grid theorem of Robertson and Seymour, the fact that a graph has no large grid minor if and only if it has small tree-width.  further propose a very simple obstruction to small tree-width inspired by that proof, showing that a graph has small tree-width if and only if it contains no large highly connected set of vertices.
['Reinhard Diestel', 'Tommy R. Jensen', 'Konstantin Yu. Gorbunov', 'Carsten Thomassen']
I am writing a research paper on a idea Highly Connected Sets and the Excluded Grid Theorem
[{"from": "human", "value": "I am writing a research paper on a idea Highly Connected Sets and the Excluded Grid Theorem"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  present a short proof of the excluded grid theorem of Robertson and Seymour, the fact that a graph has no large grid minor if and only if it has small tree-width.  further propose a very simple obstruction to small tree-width inspired by that proof, showing that a graph has small tree-width if and only if it contains no large highly connected set of vertices."}]