We prove a new generalisation of Ramsey's theorem by showing that every $2$-edge-coloured graph with sufficiently large minimum degree contains a monochromatic induced subgraph whose minimum degree remains large. From this, we also derive that every orientation of a graph with large minimum degree contains either a large transitive tournament or an induced antidirected digraph whose minimum degree is still large. As a consequence, we obtain two general tools showing that certain extensions of degree-bounded graph classes preserve degree-boundedness. A hereditary class $\mathcal{G}$ is {\it degree-bounded} if, for every integer $s$, there exists $d=d(s)$ such that every graph $G\in \mathcal{G}$ either contains $K_{s,s}$ or has minimum degree at most $d$. With these tools, we obtain for instance that odd-signable graphs and Burling graphs are degree-bounded. We also characterise exactly the oriented graphs $F$ such that the graphs admitting an orientation without any induced copy of $F$ are degree-bounded.