A well-known problem of Erdős and Hajnal from the 1960s asks whether every graph with huge chromatic number contains a subgraph with large girth and large chromatic number. Very recently, Kohlmeyer and Kruer, by means of AI tools, provided a strong negative solution to this problem. The talk aims to explain the construction method and relate it to relevant literature. Joint work with Bartosz Walczak.