{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T01:14:26Z","timestamp":1649034866214},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"5-6","license":[{"start":{"date-parts":[[2003,12,3]],"date-time":"2003-12-03T00:00:00Z","timestamp":1070409600000},"content-version":"unspecified","delay-in-days":32,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2003,11]]},"abstract":"<jats:p>Given a graph <jats:italic>H<\/jats:italic>with no isolates, the (generalized) mixed Ramsey number <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" mimetype=\"image\" xlink:href=\"S0963548303005704_inline1.png\" \/> is the smallest integer <jats:italic>r<\/jats:italic> such that every <jats:italic>H<\/jats:italic>-free graph of order <jats:italic>r<\/jats:italic> contains an <jats:italic>m<\/jats:italic>-element irredundant set. We consider some questions concerning the asymptotic behaviour of this number (i) with <jats:italic>H<\/jats:italic> fixed and <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" mimetype=\"image\" xlink:href=\"S0963548303005704_inline2.png\" \/>, (ii) with <jats:italic>m<\/jats:italic> fixed and <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" mimetype=\"image\" xlink:href=\"S0963548303005704_inline3.png\" \/> a sequence of dense graphs, in particular for the sequence <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" mimetype=\"image\" xlink:href=\"S0963548303005704_inline4.png\" \/>. Open problems are mentioned throughout the paper.<\/jats:p>","DOI":"10.1017\/s0963548303005704","type":"journal-article","created":{"date-parts":[[2003,12,3]],"date-time":"2003-12-03T14:23:14Z","timestamp":1070461394000},"page":"653-660","source":"Crossref","is-referenced-by-count":1,"title":["Mixed Ramsey Numbers Revisited"],"prefix":"10.1017","volume":"12","author":[{"given":"C. C.","family":"Rousseau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. E.","family":"Speed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2003,12,3]]},"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548303005704","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T09:22:28Z","timestamp":1589534548000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548303005704\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":0,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S0963548303005704"],"URL":"https:\/\/doi.org\/10.1017\/s0963548303005704","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}