Short Proofs of Some Extremal Results

被引：19

作者：

Conlon, David ^{[1
]}

Fox, Jacob ^{[2
]}

Sudakov, Benny ^{[3
]}

机构：

[1] Math Inst, Oxford OX1 3LB, England

[2] MIT, Dept Math, Cambridge, MA 02139 USA

[3] Univ Calif Los Angeles, Dept Math, Los Angeles, CA 90095 USA

来源：

COMBINATORICS PROBABILITY & COMPUTING | 2014年 / 23卷 / 01期

基金：

美国国家科学基金会;

关键词：

ONLINE RAMSEY GAMES; CLIQUE PARTITIONS; INDUCED FORESTS; FREE SUBGRAPHS; FREE GRAPHS; NUMBER; COMBINATORICS; THEOREMS; BOUNDS;

D O I：

10.1017/S0963548313000448

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive combinatorics, have been collected together because in each case the relevant proofs are quite short.

引用

页码：8 / 28

页数：21

共 49 条

[1] MAXIMUM INDUCED FORESTS OF PLANAR GRAPHS [J].