当前位置: X-MOL 学术Random Struct. Algorithms › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Short proofs of some extremal results III
Random Structures and Algorithms ( IF 0.9 ) Pub Date : 2020-08-30 , DOI: 10.1002/rsa.20953
David Conlon 1 , Jacob Fox 2 , Benny Sudakov 3
Affiliation  

We prove a selection of results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly from extremal graph theory and Ramsey theory, have been collected together because in each case the relevant proofs are reasonably short.

中文翻译:

一些极端结果的简短证明III

我们证明了极端组合药不同领域的一系列结果,包括对许多未解决问题的完整或部分解决方案。这些结果主要来自极值图论和Ramsey理论,已被收集在一起,因为在每种情况下,相关的证明都相当短。
更新日期:2020-10-30
down
wechat
bug