{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T21:58:57Z","timestamp":1747173537459,"version":"3.40.5"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T00:00:00Z","timestamp":1726617600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2024,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Daisies are a special type of hypergraph introduced by Bollob\u00e1s, Leader and Malvenuto. An <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000221_inline1.png\"\/><jats:tex-math>\n$r$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-daisy determined by a pair of disjoint sets <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000221_inline2.png\"\/><jats:tex-math>\n$K$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000221_inline3.png\"\/><jats:tex-math>\n$M$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> is the <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000221_inline4.png\"\/><jats:tex-math>\n$(r+|K|)$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-uniform hypergraph <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000221_inline5.png\"\/><jats:tex-math>\n$\\{K\\cup P\\,{:}\\, P\\in M^{(r)}\\}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>. Bollob\u00e1s, Leader and Malvenuto initiated the\u00a0study of Tur\u00e1n type density problems for daisies. This paper deals with Ramsey numbers of daisies, which are natural generalisations of classical Ramsey numbers. We discuss upper and lower bounds for the Ramsey number of <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000221_inline6.png\"\/><jats:tex-math>\n$r$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-daisies and also for special cases where the size of the kernel is bounded.<\/jats:p>","DOI":"10.1017\/s0963548324000221","type":"journal-article","created":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T08:34:37Z","timestamp":1726648477000},"page":"795-806","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["On the Ramsey numbers of daisies I"],"prefix":"10.1017","volume":"33","author":[{"given":"Pavel","family":"Pudl\u00e1k","sequence":"first","affiliation":[]},{"given":"Vojtech","family":"R\u00f6dl","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7561-8073","authenticated-orcid":false,"given":"Marcelo","family":"Sales","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2024,9,18]]},"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548324000221","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T13:25:01Z","timestamp":1731331501000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548324000221\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,18]]},"references-count":0,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["S0963548324000221"],"URL":"https:\/\/doi.org\/10.1017\/s0963548324000221","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"type":"print","value":"0963-5483"},{"type":"electronic","value":"1469-2163"}],"subject":[],"published":{"date-parts":[[2024,9,18]]},"assertion":[{"value":"\u00a9 The Author(s), 2024. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}