| 书目名称 | Extremal Combinatorics | | 副标题 | With Applications in | | 编辑 | Stasys Jukna | | 视频video | | | 概述 | Provides an introductory, self-contained and up-to-date source in extremal combinatorics suitable for a broad community: mathematicians, computer scientists, and engineers.Covers a substantial part of | | 丛书名称 | Texts in Theoretical Computer Science. An EATCS Series | | 图书封面 |  | | 描述 | Combinatorial mathematics has been pursued since time immemorial, and at a reasonable scientific level at least since Leonhard Euler (1707-1783). It ren dered many services to both pure and applied mathematics. Then along came the prince of computer science with its many mathematical problems and needs - and it was combinatorics that best fitted the glass slipper held out. Moreover, it has been gradually more and more realized that combinatorics has all sorts of deep connections with "mainstream areas" of mathematics, such as algebra, geometry and probability. This is why combinatorics is now apart of the standard mathematics and computer science curriculum. This book is as an introduction to extremal combinatorics - a field of com binatorial mathematics which has undergone aperiod of spectacular growth in recent decades. The word "extremal" comes from the nature of problems this field deals with: if a collection of finite objects (numbers, graphs, vectors, sets, etc. ) satisfies certain restrictions, how large or how small can it be? For example, how many people can we invite to a party where among each three people there are two who know each other and two who don‘t know each o | | 出版日期 | Textbook 20011st edition | | 关键词 | Diskrete Mathematik; Kombinatorik; algorithms; combinatorics; computational complexity; discrete mathemat | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-662-04650-0 | | isbn_ebook | 978-3-662-04650-0Series ISSN 1862-4499 Series E-ISSN 1862-4502 | | issn_series | 1862-4499 | | copyright | Springer-Verlag Berlin Heidelberg 2001 |
The information of publication is updating
|
|
发表于 2025-3-21 18:19:12
