Praise for the Third Edition “Researchers of any kind of extremal combinatorics or theoretical
computer science will welcome the new edition of this book.”-MAA Reviews Maintaining a …

This book is primarily a textbook introduction to various areas of discrete geometry. In each
area, it explains several key results and methods, in an accessible and concrete manner. It …

The History of Degenerate (Bipartite) Extremal Graph Problems Page 1 BOLYAI SOCIETY
Erdos Centennial MATHEMATICAL STUDIES, 25 pp. 169–264. The History of Degenerate (Bipartite) …

For two graphs T and H with no isolated vertices and for an integer n, let ex (n, T, H) denote
the maximum possible number of copies of T in an H-free graph on n vertices. The study of …

Random graphs have proven to be one of the most important and fruitful concepts in modern
Combinatorics and Theoretical Computer Science. Besides being a fascinating study …

Discrepancy theory is also called the theory of irregularities of distribution. Here are some
typical questions: What is the" most uniform" way of dis tributing n points in the unit square …

The H-free process, for some fixed graph H, is the random graph process defined by starting
with an empty graph on n vertices and then adding edges one at a time, chosen uniformly at …

This survey is two-fold. We first report new progress on the spectral extremal results on the
Tur\'{a} n type problems in graph theory. More precisely, we shall summarize the spectral …

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 …

In recent years several classical results in extremal graph theory have been improved in a
uniform way and their proofs have been simplified and streamlined. These results include a …