{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T01:30:53Z","timestamp":1773538253335,"version":"3.50.1"},"reference-count":10,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2011,8,18]],"date-time":"2011-08-18T00:00:00Z","timestamp":1313625600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2011,9]]},"abstract":"<jats:p>Our aim in this note is to make some conjectures about extremal densities of daisy-free families, where a \u2018daisy\u2019 is a certain hypergraph. These questions turn out to be related to some Tur\u00e1n problems in the hypercube, but they are also natural in their own right. We start by giving the daisy conjectures, and some related problems, and shall then go on to describe the connection with vertex-Tur\u00e1n problems in the hypercube.<\/jats:p>","DOI":"10.1017\/s0963548311000319","type":"journal-article","created":{"date-parts":[[2011,8,18]],"date-time":"2011-08-18T06:19:13Z","timestamp":1313648353000},"page":"743-747","source":"Crossref","is-referenced-by-count":19,"title":["Daisies and Other Tur\u00e1n Problems"],"prefix":"10.1017","volume":"20","author":[{"given":"B\u00c9LA","family":"BOLLOB\u00c1S","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"IMRE","family":"LEADER","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CLAUDIA","family":"MALVENUTO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2011,8,18]]},"reference":[{"key":"S0963548311000319_ref9","unstructured":"[9] Kostochka E. A. (1976) Piercing the edges of the n-dimensional unit cube (in Russian). Diskret. Analiz Vyp. 28 Metody Diskretnogo Analiza v Teorii Grafov i Logiceskih Funkcii 55\u201364."},{"key":"S0963548311000319_ref5","unstructured":"[5] Goldwasser J. (2011) Personal communication."},{"key":"S0963548311000319_ref2","volume-title":"Combinatorics","author":"Bollob\u00e1s","year":"1986"},{"key":"S0963548311000319_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(89)90054-3"},{"key":"S0963548311000319_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01929486"},{"key":"S0963548311000319_ref1","doi-asserted-by":"publisher","DOI":"10.1137\/060649422"},{"key":"S0963548311000319_ref8","first-page":"83","volume-title":"Surveys in Combinatorics 2011","author":"Keevash"},{"key":"S0963548311000319_ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2009.07.004"},{"key":"S0963548311000319_ref3","unstructured":"[3] Bukh B. (2011) Personal communication."},{"key":"S0963548311000319_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF02759942"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548311000319","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T02:33:18Z","timestamp":1556332398000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548311000319\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,18]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["S0963548311000319"],"URL":"https:\/\/doi.org\/10.1017\/s0963548311000319","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,18]]}}}