an abstract simplicial complex $\sigma$ is said to be $k$-connected if for each $−1 \leq d \leq k$ and each continuous map $f$ from the sphere $s$ to $\|\sigma\|$ (the polyhedron of the geometric realization of $\sigma$), the map $f$ can be extended to a continuous map from the ball $b_{d+1}$ to $\|\sigma\|$. the topological connectedness of $\sigma$ is the largest $k$ for which it is $k$-connected. in 2000 a link was discovered between the topological connectedness of the independence complex of a graph and various other important graph parameters to do with colouring and partitioning. when the graph represents some other combinatorial structure, for example when it is the line graph of a hypergraph $h$, this link can be exploited to obtain information such as lower bounds on the matching number of $h$. since its discovery there have been various other applications of this phenomenon to other combinatorial problems, including several different types of colouring (list colouring, strong colouring, delay edge colouring, circular colouring), hypergraph packing and covering, toughness and hamiltonicity, and job scheduling and other resource allocation problems. in this talk we give an overview of this technique, and describe some of its applications.