Article contents
Ramsey Problems with Bounded Degree Spread
Published online by Cambridge University Press: 12 September 2008
Abstract
Let k be a positive integer, k ≥ 2. In this paper we study bipartite graphs G such that, for n sufficiently large, each two-coloring of the edges of the complete graph Kn gives a monochromatic copy of G, with some k of its vertices having the maximum degree of these k vertices minus the minimum degree of these k vertices (in the colored Kn) at most k − 2.
- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 1993
References
- 3
- Cited by