关于不含大型空子图与完全子图的有限图的诱导子图
逻辑
2017-08-21 v3 组合数学
摘要
Erd\H{o}s 和 Hajnal 在其著名论文 [Ramsey-Type Theorems, Discrete Appl. Math. 25 (1989) 37-52] 中提出了如下问题:对于任意有限图 ,是否存在常数 ,使得对于任意有限图 ,若 不包含大小至少为 的完全或空诱导子图,则 可同构嵌入到 中?该肯定回答被称为 Erd\H{o}s-Hajnal 猜想。本文定理 3.20 肯定了该猜想。为此,我们研究了有限集超积的精细结构,因此我们的研究具有模型论特征。
关键词
引用
@article{arxiv.1211.3876,
title = {On Induced Subgraphs of Finite Graphs not Containing Large Empty and Complete Subgraphs},
author = {Gábor Sági},
journal= {arXiv preprint arXiv:1211.3876},
year = {2017}
}
备注
20 pages. The previous version (which was uploaded in 2012) contains a serious mistake which makes the proof of the main result invalid. This version is based on similar ideas, but contains rather different technical details