Balazs Patkos – författare

Extremal Finite Set Theory surveys old and new results in the area of extremal set system theory. It presents an overview of the main techniques and tools (shifting, the cycle method, profile polytopes, incidence matrices, flag algebras, etc.) used in the different subtopics. The book focuses on the cardinality of a family of sets satisfying certain combinatorial properties. It covers recent progress in the subject of set systems and extremal combinatorics.Intended for graduate students, instructors teaching extremal combinatorics and researchers, this book serves as a sound introduction to the theory of extremal set systems. In each of the topics covered, the text introduces the basic tools used in the literature. Every chapter provides detailed proofs of the most important results and some of the most recent ones, while the proofs of some other theorems are posted as exercises with hints. Features: Presents the most basic theorems on extremal set systems Includes many proof techniques Contains recent developments The book’s contents are well suited to form the syllabus for an introductory course About the Authors: Dániel Gerbner is a researcher at the Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences in Budapest, Hungary. He holds a Ph.D. from Eötvös Loránd University, Hungary and has contributed to numerous publications. His research interests are in extremal combinatorics and search theory.Balázs Patkós is also a researcher at the Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences. He holds a Ph.D. from Central European University, Budapest and has authored several research papers. His research interests are in extremal and probabilistic combinatorics.

Extremal Finite Set Theory surveys old and new results in the area of extremal set system theory. It presents an overview of the main techniques and tools (shifting, the cycle method, profile polytopes, incidence matrices, flag algebras, etc.) used in the different subtopics. The book focuses on the cardinality of a family of sets satisfying certain combinatorial properties. It covers recent progress in the subject of set systems and extremal combinatorics.Intended for graduate students, instructors teaching extremal combinatorics and researchers, this book serves as a sound introduction to the theory of extremal set systems. In each of the topics covered, the text introduces the basic tools used in the literature. Every chapter provides detailed proofs of the most important results and some of the most recent ones, while the proofs of some other theorems are posted as exercises with hints. Features: Presents the most basic theorems on extremal set systems Includes many proof techniques Contains recent developments The book’s contents are well suited to form the syllabus for an introductory courseAbout the Authors: Dániel Gerbner is a researcher at the Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences in Budapest, Hungary. He holds a Ph.D. from Eötvös Loránd University, Hungary and has contributed to numerous publications. His research interests are in extremal combinatorics and search theory.Balázs Patkós is also a researcher at the Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences. He holds a Ph.D. from Central European University, Budapest and has authored several research papers. His research interests are in extremal and probabilistic combinatorics.