Problems and results in extremal combinatorics - I
Problems and results in extremal combinatorics - I
复制标题
DOI：
10.1016/s0012-365x(03)00227-9
复制
发表时间：
2003-12-06
影响因子：
0.8
通讯作者：
Alon, N
中科院分区：
文献类型：
--
作者：
Alon, N
极值组合学是离散数学中的一个领域，在过去的几十年里得到了长足的发展。本文包含了收集的问题和结果，在该地区，包括解决方案或部分解决方案，开放的问题，建议由各种研究人员在极值图论，极值有限集理论和组合几何。这并不意味着要对该地区进行全面调查，它只是各种极端问题的集合，希望这些问题很有趣。问题的选择难免有些偏颇，正如论文的题目所暗示的，我希望将来能写一篇相关的论文。本文的每一部分基本上都是独立的，可以单独阅读。(C)2003 Elsevier B.V.保留所有权利。
Extremal combinatorics is an area in discrete mathematics that has developed spectacularly during the last decades. This paper contains a collection of problems and results in the area, including solutions or partial solutions to open problems suggested by various researchers in extremal graph theory, extremal finite set theory and combinatorial geometry. This is not meant to be a comprehensive survey of the area, it is merely a collection of various extremal problems, which are hopefully interesting. the choice of the problems is inevitably somewhat biased, and as the title of the paper suggests I hope to write a related paper in the future. Each section of this paper is essentially self contained, and can be read separately. (C) 2003 Elsevier B.V. All rights reserved.