 Burr–Erdős conjecture

The Burr–Erdős conjecture is a statement in combinatorial mathematics related to graph theory. It was proposed by mathematicians Charles J. Burr and Paul Erdős in the early 1980s. The conjecture deals with the properties of graphs and specifically focuses on the existence of certain kinds of subgraphs within larger graphs.