Abstract: | For a positive integer , a graph is -knitted if for each subset of vertices, and every partition of into (disjoint) parts for some , one can find disjoint connected subgraphs such that contains for each . In this article, we show that if the minimum degree of an -vertex graph is at least when , then is -knitted. The minimum degree is sharp. As a corollary, we obtain that -contraction-critical graphs are -connected. |