Multicolored Bipartite Ramsey Numbers of Large Cycles
For an integer r ≥ 2 and bipartite graphs Hi, where 1≤ i ≤ r the bipartite Ramsey number br(H1, H2, …, Hr) is the minimum integer N such that any r-edge coloring of the complete bipartite graph KN,N contains a monochromatic subgraph isomorphic to Hi in color i for some 1 ≤ i ≤ r. We show that if \(r \ge 3,{\alpha _1},{\alpha _2} > 0,{\alpha _{j + 2}} \ge [(j + 2)! - 1]\sum\limits_{i = 1}^{j + 1} {{\alpha _i}} \) for j = 1, 2, …, r −2, then \(br({C_{2\left\lfloor {{\alpha _1}\,n} \right\rfloor }},{C_{2\left\lfloor {{\alpha _2}\,n} \right\rfloor }}, \cdots ,{C_{2\left\lfloor {{\alpha _r}\,n} \right\rfloor }}) = (\sum\limits_{j = 1}^r {{\alpha _j} + o(1))n} \).
期刊介绍:
Acta Mathematicae Applicatae Sinica (English Series) is a quarterly journal established by the Chinese Mathematical Society. The journal publishes high quality research papers from all branches of applied mathematics, and particularly welcomes those from partial differential equations, computational mathematics, applied probability, mathematical finance, statistics, dynamical systems, optimization and management science.