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 条
  • [1] A new lower, bound for a Ramsey-type problem
    Sudakov, B
    COMBINATORICA, 2005, 25 (04) : 487 - 498
  • [2] Co-Nondeterminism in Compositions: A Kernelization Lower Bound for a Ramsey-Type Problem
    Kratsch, Stefan
    ACM TRANSACTIONS ON ALGORITHMS, 2014, 10 (04)
  • [3] ON A RAMSEY-TYPE PROBLEM
    CHUNG, FRK
    JOURNAL OF GRAPH THEORY, 1983, 7 (01) : 79 - 83
  • [4] A Ramsey-type bound for rectangles
    Toth, G
    JOURNAL OF GRAPH THEORY, 1996, 23 (01) : 53 - 56
  • [5] A Ramsey-type problem and the Turan numbers
    Alon, N
    Erdos, P
    Gunderson, DS
    Molloy, M
    JOURNAL OF GRAPH THEORY, 2002, 40 (02) : 120 - 129
  • [6] RAMSEY-TYPE PROBLEM FOR PATHS IN DIGRAPHS
    WILLIAMSON, JE
    MATHEMATISCHE ANNALEN, 1973, 203 (02) : 117 - 118
  • [7] On a Ramsey-type problem of Erds and Pach
    Kang, Ross J.
    Long, Eoin
    Patel, Viresh
    Regts, Guus
    BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 2017, 49 (06) : 991 - 999
  • [8] Constructive bounds for a Ramsey-type problem
    Alon, N
    Krivelevich, M
    GRAPHS AND COMBINATORICS, 1997, 13 (03) : 217 - 225
  • [9] Constructive Bounds for a Ramsey-Type Problem
    Noga Alon
    Michael Krivelevich
    Graphs and Combinatorics, 1997, 13 : 217 - 225
  • [10] NOTE ON A RAMSEY-TYPE PROBLEM IN GEOMETRY
    CSIZMADIA, G
    TOTH, G
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 1994, 65 (02) : 302 - 306
12345