On ramsey numbers for large disjoint unions of graphs |
| |
Authors: | Stefan A Burr |
| |
Institution: | City College, City University of New York, New York, NY 10031, U.S.A. |
| |
Abstract: | Let
be a fixed finite set of connected graphs. Results are given which, in principle, permit the Ramsey number r(G, H) to be evaluated exactly when G and H are sufficiently large disjoint unions of graphs taken from
. Such evaluations are often possible in practice, as shown by several examples. For instance, when m and n are large, and mn, r(mKk, nKl)=(k ? 1)m+ln+r(Kk?1, Kl?1)?2. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|