{"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":1747173537335,"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>A <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000208_inline1.png\"\/><jats:tex-math>\n$(k+r)$\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=\"S0963548324000208_inline2.png\"\/><jats:tex-math>\n$H$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> on <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000208_inline3.png\"\/><jats:tex-math>\n$(k+m)$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> vertices is an <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000208_inline4.png\"\/><jats:tex-math>\n$(r,m,k)$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-daisy if there exists a partition of the vertices <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000208_inline5.png\"\/><jats:tex-math>\n$V(H)=K\\cup M$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> with <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000208_inline6.png\"\/><jats:tex-math>\n$|K|=k$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>, <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000208_inline7.png\"\/><jats:tex-math>\n$|M|=m$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> such that the set of edges of <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000208_inline8.png\"\/><jats:tex-math>\n$H$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> is all the <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000208_inline9.png\"\/><jats:tex-math>\n$(k+r)$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-tuples <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000208_inline10.png\"\/><jats:tex-math>\n$K\\cup P$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>, where <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000208_inline11.png\"\/><jats:tex-math>\n$P$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> is an <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000208_inline12.png\"\/><jats:tex-math>\n$r$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-tuple of <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000208_inline13.png\"\/><jats:tex-math>\n$M$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>. We obtain an <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000208_inline14.png\"\/><jats:tex-math>\n$(r-2)$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-iterated exponential lower bound to the Ramsey number of an <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000208_inline15.png\"\/><jats:tex-math>\n$(r,m,k)$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-daisy for <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000208_inline16.png\"\/><jats:tex-math>\n$2$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-colours. This matches the order of magnitude of the best lower bounds for the Ramsey number of a complete <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000208_inline17.png\"\/><jats:tex-math>\n$r$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-graph.<\/jats:p>","DOI":"10.1017\/s0963548324000208","type":"journal-article","created":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T08:16:41Z","timestamp":1726647401000},"page":"742-768","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["On the Ramsey numbers of daisies II"],"prefix":"10.1017","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7561-8073","authenticated-orcid":false,"given":"Marcelo","family":"Sales","sequence":"first","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\/S0963548324000208","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T13:25:04Z","timestamp":1731331504000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548324000208\/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":["S0963548324000208"],"URL":"https:\/\/doi.org\/10.1017\/s0963548324000208","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"}}]}}