Extremal Problems for Finite Sets (Student Mathematical Library, 86, Band 86) - Softcover

Inhaltsangabe

After numbers, sets are the most fundamental notion in mathematics, say Frankl and Tokushige, and the simplest sets are those with a finite number of elements--finite sets. They address combinatorial, mostly extremal, problems concerning systems of subsets of a given finite set. Among their problems are the Erdos-Ko-Rado theorem via shifting, the Kleitman theorem for no s pairwise disjoint sets, uniform measure versus product measure, Fürude's structure theorem, some algebraic constructions for L systems, and a cross intersection problem with measures. Annotation ©2018 Ringgold, Inc., Portland, OR (protoview.com)

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.