论文标题
极端组合学的问题和结果-IV
Problems and results in Extremal Combinatorics -- IV
论文作者
论文摘要
极端组合学是离散数学中最活跃的主题之一，处理的问题通常是由其他领域的问题（包括理论计算机科学和信息理论）引起的。本文包含了该领域的问题和结果的集合，包括解决方案或部分解决方案，以解决各种研究人员建议的开放问题。此处考虑的主题包括极端图理论，编码理论和社会选择中的问题。这绝不是对该地区的全面调查，仅仅是问题，结果和证据的集合，这是希望有趣的。正如本文的标题所暗示的那样，这是前三篇具有相同风味的论文的续集。本文的每个部分本质上都是自我包含的，可以单独阅读。
Extremal Combinatorics is among the most active topics in Discrete Mathematics, dealing with problems that are often motivated by questions in other areas, including Theoretical Computer Science and Information Theory. This paper contains a collection of problems and results in the area, including solutions or partial solutions to open problems suggested by various researchers. The topics considered here include questions in Extremal Graph Theory, Coding Theory and Social Choice. This is by no means a comprehensive survey of the area, and is merely a collection of problems, results and proofs, which are hopefully interesting. As the title of the paper suggests, this is a sequel of three previous papers of the same flavour. Each section of this paper is essentially self contained, and can be read separately.
