A New Lower Bound For A Ramsey-Type Problem

被引：0
|
作者：
Benny Sudakov*
机构：
[1] Princeton University and Institute for Advanced Study,Department of Mathematics
来源：
Combinatorica | 2005年 / 25卷
关键词：
05C35; 05C55; 05D10;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Let 3 ≤ r < s be fixed integers and let G be a graph on n vertices not containing a complete graph on s vertices. The main aim of this paper is to provide a new lower bound on the size of the maximum subset of G without a copy of complete graph Kr. Our results substantially improve previous bounds of Krivelevich and Bollobás and Hind.
引用
收藏
页码：487 / 498
页数：11
相关论文
共 50 条
  • [31] Ramsey-type results for oriented trees
    Kohayakawa, Y
    Luczak, T
    Rodl, V
    JOURNAL OF GRAPH THEORY, 1996, 22 (01) : 1 - 8
  • [32] Ramsey-type theorems with forbidden subgraphs
    Alon, N
    Pach, J
    Solymosi, J
    COMBINATORICA, 2001, 21 (02) : 155 - 170
  • [33] A RAMSEY-TYPE THEOREM FOR TRACEABLE GRAPHS
    GALVIN, F
    RIVAL, I
    SANDS, B
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1982, 33 (01) : 7 - 16
  • [34] A generalization of a Ramsey-type theorem on hypermatchings
    Baginski, P
    JOURNAL OF GRAPH THEORY, 2005, 50 (02) : 142 - 149
  • [35] Ramsey-Type Results for Gallai Colorings
    Gyarfas, Andras
    Sarkozy, Gabor N.
    Sebo, Andras
    Selkow, Stanley
    JOURNAL OF GRAPH THEORY, 2010, 64 (03) : 233 - 243
  • [36] RAMSEY-TYPE PROPERTIES OF RELATIONAL STRUCTURES
    ELZAHAR, M
    SAUER, NW
    DISCRETE MATHEMATICS, 1991, 94 (01) : 1 - 10
  • [37] Ramsey-type Theorems with Forbidden Subgraphs
    Noga Alon
    János Pach
    József Solymosi
    Combinatorica, 2001, 21 : 155 - 170
  • [38] Attosecond optical and Ramsey-type interference
    Matsubara, Takuya
    Nabekawa, Yasuo
    Ishikawa, Kenichi L.
    Yamanouchi, Kaoru
    Midorikawa, Katsumi
    2021 CONFERENCE ON LASERS AND ELECTRO-OPTICS EUROPE & EUROPEAN QUANTUM ELECTRONICS CONFERENCE (CLEO/EUROPE-EQEC), 2021,
  • [39] Ramsey-Type Theorem for Spatial Graphs
    Seiya Negami
    Graphs and Combinatorics, 1998, 14 : 75 - 80
  • [40] Colouring of graphs with Ramsey-type forbidden subgraphs
    Dabrowski, Konrad K.
    Golovach, Petr A.
    Paulusma, Daniel
    THEORETICAL COMPUTER SCIENCE, 2014, 522 : 34 - 43
12345