{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T05:44:18Z","timestamp":1671774258655},"reference-count":5,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"unspecified","delay-in-days":5490,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[1993,9]]},"abstract":"<jats:p>Let <jats:italic>k<\/jats:italic> be a positive integer, <jats:italic>k<\/jats:italic> \u2265 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 <jats:italic>K<jats:sub>n<\/jats:sub><\/jats:italic> gives a monochromatic copy of <jats:italic>G<\/jats:italic>, with some <jats:italic>k<\/jats:italic> of its vertices having the maximum degree of these <jats:italic>k<\/jats:italic> vertices minus the minimum degree of these <jats:italic>k<\/jats:italic> vertices (in the colored <jats:italic>K<jats:sub>n<\/jats:sub><\/jats:italic>) at most <jats:italic>k<\/jats:italic> \u2212 2.<\/jats:p>","DOI":"10.1017\/s0963548300000663","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T11:18:58Z","timestamp":1221218338000},"page":"263-269","source":"Crossref","is-referenced-by-count":3,"title":["Ramsey Problems with Bounded Degree Spread"],"prefix":"10.1017","volume":"2","author":[{"given":"G.","family":"Chen","sequence":"first","affiliation":[]},{"given":"R. H.","family":"Schelp","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"S0963548300000663_ref003","doi-asserted-by":"publisher","DOI":"10.1006\/eujc.1993.1023"},{"key":"S0963548300000663_ref001","unstructured":"[1] Albertson M. O. (preprint) People who know people."},{"key":"S0963548300000663_ref002","unstructured":"[2] Albertson M. O. and Berman D. M. (preprint) Ramsey graphs without repeated degrees."},{"key":"S0963548300000663_ref005","doi-asserted-by":"crossref","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","article-title":"On a problem of Zarankiewicz","volume":"3","author":"K\u0151v\u00e1ri","year":"1954","journal-title":"Colloq. Math."},{"key":"S0963548300000663_ref004","volume-title":"Ramsey Theory","author":"Graham","year":"1990"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548300000663","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T21:58:00Z","timestamp":1557957480000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548300000663\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["S0963548300000663"],"URL":"https:\/\/doi.org\/10.1017\/s0963548300000663","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}