On a problem of Erdős and Rado

被引：0
作者：
Jean A. Larson
William J. Mitchell
机构：
[1] University of Florida,Department of Mathematics
来源：
Annals of Combinatorics | 1997年 / 1卷 / 1期
关键词：
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 条
  • [21] An extremal problem on potentially Kr,s-graphic sequences
    Yin, JH
    Li, JS
    [J]. DISCRETE MATHEMATICS, 2003, 260 (1-3) : 295 - 305
  • [22] Exquisite corpse: the dead and the problem of community in Elias's Khwabnama
    Khan, Naveeda
    [J]. INTER-ASIA CULTURAL STUDIES, 2024, 25 (04) : 638 - 653
  • [23] India, the Arabs, and Britain's Problem In Palestine, 1937-193911
    O'Halloran, Erin M. B.
    [J]. INTERNATIONAL HISTORY REVIEW, 2021, 43 (03) : 547 - 566
  • [24] Approximating the directed path partition problem ☆
    Chen, Yong
    Chen, Zhi-Zhong
    Kennedy, Curtis
    Lin, Guohui
    Xu, Yao
    Zhang, An
    [J]. INFORMATION AND COMPUTATION, 2024, 297
  • [25] A Turan-type generalization of Tuza's triangle edge cover problem
    Borg, Peter
    Fenech, Kurt
    [J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2020, 78 : 399 - 412
  • [26] A New Approximation Algorithm for the Unbalanced Min s-t Cut Problem
    Zhang, Peng
    [J]. COMPUTING AND COMBINATORICS, COCOON 2014, 2014, 8591 : 346 - 356
  • [27] Shortest Trail Problem with Respect to Prohibited maneuvers
    Majer, Tomas
    [J]. 28TH INTERNATIONAL CONFERENCE ON MATHEMATICAL METHODS IN ECONOMICS 2010, PTS I AND II, 2010, : 418 - 422
  • [28] A Novel Method for Solving the River-Crossing Problem Based on Dijkstra's Algorithm
    Liu, Tie
    Zheng, Liang
    [J]. INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND MANAGEMENT ENGINEERING (ITME 2014), 2014, : 6 - 10
  • [29] An inverse eigenvalue problem for structured matrices determined by graph pairs
    Berliner, A. H.
    Catral, M.
    Cavers, M.
    Kim, S.
    van den Driessche, P.
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2024, 699 : 586 - 603
  • [30] Shortest Path Problem In Huge Graphs Making Use of Reachness of Vertices
    Majer, Tomas
    [J]. MATHEMATICAL METHODS IN ECONOMICS 2013, PTS I AND II, 2013, : 558 - 562
12345