Some multicolor bipartite Ramsey numbers involving cycles and a small number of colors |
| |
Authors: | Johannes H Hattingh Ernst J Joubert |
| |
Institution: | 1. Department of Mathematics, East Carolina University, Greenville, NC 27858, USA;2. Department of Mathematics, University of Johannesburg, Auckland Park, 2006, South Africa |
| |
Abstract: | For bipartite graphs , the bipartite Ramsey number is the least positive integer so that any coloring of the edges of with colors will result in a copy of in the th color for some . In this paper, our main focus will be to bound the following numbers: and for all for and for Furthermore, we will also show that these mentioned bounds are generally better than the bounds obtained by using the best known Zarankiewicz-type result. |
| |
Keywords: | Bipartite graph Ramsey Cycle |
本文献已被 ScienceDirect 等数据库收录! |
|