Skip to main content Accessibility help

Ramsey Problems with Bounded Degree Spread

  • G. Chen (a1) and R. H. Schelp (a2)

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.

Hide All
[1]Albertson, M. O. (preprint) People who know people.
[2]Albertson, M. O. and Berman, D. M. (preprint) Ramsey graphs without repeated degrees.
[3]Erdős, P., Chen, G., Rousseau, C. C. and Schelp, R. H. (1993) Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs. Europ. J. Combinatorics 14 183189.
[4]Graham, R. L., Rothschild, B. R. and Spencer, J. H. (1990) Ramsey Theory (2nd Edition), John Wiley & Sons, New York.
[5]Kővári, T., Sós, V. T. and Túran, P. (1954) On a problem of Zarankiewicz. Colloq. Math. 3 5057.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed