OurBigBook About$ Donate
 Sign in Sign up

Turán's brick factory problem

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Fields of abstract algebra Algebraic topology Topological graph theory
 0 By others on same topic  0 Discussions Create my own version
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.

 Ancestors (6)

  1. Topological graph theory
  2. Algebraic topology
  3. Fields of abstract algebra
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook