everything.study
MATH 426

Extremal Combinatorics

1.5 credits · Undergraduate

Maximizing the size of a combinatorial structure subject to constraints. Extremal problems for set systems, graphs, hypergraphs, permutations, subsets of the integers and partially ordered sets and connections to other areas of mathematics.

Sources