Turán's brick factory problem
= Turán's brick factory problem
{wiki=Turán's_brick_factory_problem}
Turán's brick factory problem is a classic problem in combinatorial optimization, particularly in the field of graph theory. It is named after the Hungarian mathematician Paul Erdős and his colleague László Turán, who studied problems involving extremal graph theory. The problem can be described as follows: Imagine a brick factory that produces bricks of various colors.