Here we prove a stability version of a Ramsey-type Theorem for paths. Thus in any 2-coloring of the edges of the complete graph K. we can either find a monochromatic path substantially longer than 2n/3, or the coloring is close to the extremal coloring. (C) 2009 Elsevier B.V. All rights reserved.
机构:
Univ Fed Rio de Janeiro, Programa Engn Sistemas & Comp, Rio De Janeiro, BrazilUniv Fed Rio de Janeiro, Programa Engn Sistemas & Comp, Rio De Janeiro, Brazil
Botler, F.
Cano, R.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Estadual Campinas, Inst Comp, Campinas, SP, BrazilUniv Fed Rio de Janeiro, Programa Engn Sistemas & Comp, Rio De Janeiro, Brazil
Cano, R.
Sambinelli, M.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Sao Paulo, Dept Ciencia Comp, Sao Paulo, BrazilUniv Fed Rio de Janeiro, Programa Engn Sistemas & Comp, Rio De Janeiro, Brazil
机构:
Hebei Normal Univ, Sch Math Sci, Shijiazhuang 050024, Hebei, Peoples R China
Hebei Int Joint Res Ctr Math & Interdisciplinary, Shijiazhuang 050024, Hebei, Peoples R ChinaHebei Normal Univ, Sch Math Sci, Shijiazhuang 050024, Hebei, Peoples R China
Song, Ruyu
Zhang, Yanbo
论文数: 0引用数: 0
h-index: 0
机构:
Hebei Normal Univ, Sch Math Sci, Shijiazhuang 050024, Hebei, Peoples R China
Hebei Int Joint Res Ctr Math & Interdisciplinary, Shijiazhuang 050024, Hebei, Peoples R ChinaHebei Normal Univ, Sch Math Sci, Shijiazhuang 050024, Hebei, Peoples R China