Jump to content

Extremal Problems For Finite Sets

From Wikipedia, the free encyclopedia

First edition

Extremal Problems For Finite Sets is a mathematics book on the extremal combinatorics of finite sets and families of finite sets. It was written by Péter Frankl and Norihide Tokushige, and published in 2018 by the American Mathematical Society as volume 86 of their Student Mathematical Library book series. The Basic Library List Committee of the Mathematical Association of America has suggested its inclusion in undergraduate mathematics libraries.[1]

Topics

[edit]

The book has 32 chapters.[2] Its topics include:

Many other results in this area are also included.[2]

Audience and reception

[edit]

Although the book is intended for undergraduate mathematics students,[2] reviewer Mark Hunacek suggests that readers will either need to be familiar with, or comfortable looking up, terminology for hypergraphs and metric spaces. He suggests that the appropriate audience for the book would be advanced undergraduates who have already demonstrated an interest in combinatorics. However, despite the narrowness of this group, he writes that the book will likely be very valuable to them, as the only source for this material that is written at an undergraduate level.[1]

References

[edit]
  1. ^ a b Hunacek, Mark (October 2018), "Review of Extremal Problems For Finite Sets", MAA Reviews, Mathematical Association of America
  2. ^ a b c d e f g Chaudhary, M. P., "Review of Extremal Problems For Finite Sets", zbMATH, Zbl 1416.05001
  3. ^ a b c Holroyd, Fred C., "Review of Extremal Problems For Finite Sets", Mathematical Reviews, MR 3822342