A survey of degree-boundedness

Abstract

Suppose a graph has no large balanced bicliques, but has large minimum degree. Then what can we say about its induced subgraphs? This question motivates the study of degree-boundedness, which is like $\ddot{I}‡$-boundedness but for minimum degree instead of chromatic number. We survey this area with an eye towards open problems.