On a problem of Erdős and Rado

被引:0
|
作者
Jean A. Larson
William J. Mitchell
机构
[1] University of Florida,Department of Mathematics
关键词
05C55; 05C20; 03E10; digraph; Ramsey; partition; ordinal; graph; transitive tournament;
D O I
10.1007/BF02558478
中图分类号
学科分类号
摘要
We give some improved estimates for the digraph Ramsey numbersr(Kn*,Lm), the smallest numberp such that any digraph of orderp either has an independent set ofn vertices or contains a transitive tournament of orderm.
引用
收藏
页码:245 / 252
页数:7
相关论文
共 50 条
  • [1] A variation of a conjecture due to Erdös and Sós
    Jian Hua Yin
    Jiong Sheng Li
    Acta Mathematica Sinica, English Series, 2009, 25 : 795 - 802
  • [2] A Variation of a Conjecture Due to Erds and Sós
    Jian Hua YINDepartment of Mathematics
    Acta Mathematica Sinica(English Series), 2009, 25 (05) : 795 - 802
  • [3] Erdős–Kakutani phenomena for paths
    S. Todorcevic
    Acta Mathematica Hungarica, 2021, 163 : 168 - 173
  • [4] The Threshold for the Erdős, Jacobson and Lehel Conjecture to Be True
    Jiong Sheng Li
    Jian Hua Yin
    Acta Mathematica Sinica, 2006, 22 : 1133 - 1138
  • [5] Disjunctive Rado numbers
    Johnson, B
    Schaal, D
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2005, 112 (02) : 263 - 276
  • [6] Growth rates of the bipartite Erdős-Gyárfás function
    Li, Xihe
    Broersma, Hajo
    Wang, Ligong
    JOURNAL OF GRAPH THEORY, 2024, 107 (03) : 597 - 628
  • [7] Towards the Erdős-Gallai cycle decomposition conjecture
    Bucic, Matija
    Montgomery, Richard
    ADVANCES IN MATHEMATICS, 2024, 437
  • [8] The Erdös-Jacobson-Lehel conjecture on potentiallyPk-graphic sequence is true
    Jiongsheng Li
    Zixia Song
    Rong Luo
    Science in China Series A: Mathematics, 1998, 41 : 510 - 520
  • [9] On some Rado numbers for generalized arithmetic progressions
    Grynkiewicz, DJ
    DISCRETE MATHEMATICS, 2004, 280 (1-3) : 39 - 50
  • [10] The Erds-Jacobson-Lehel conjecture on potentially Pk-graphic sequence is true
    李炯生
    宋梓霞
    罗荣
    Science China Mathematics, 1998, (05) : 510 - 520