{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:51Z","timestamp":1740107151837,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T00:00:00Z","timestamp":1568073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T00:00:00Z","timestamp":1568073600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1600592"],"award-info":[{"award-number":["DMS-1600592"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s00373-019-02087-2","type":"journal-article","created":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T07:03:51Z","timestamp":1568099031000},"page":"1495-1502","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extremal Union-Closed Set Families"],"prefix":"10.1007","volume":"35","author":[{"given":"Guantao","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hein","family":"van\u00a0der Holst","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandr","family":"Kostochka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nana","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,10]]},"reference":[{"issue":"3","key":"2087_CR1","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/j.jcta.2012.10.005","volume":"120","author":"Igor Balla","year":"2013","unstructured":"Balla, Igor, Bollob\u00e1s, B\u00e9la, Eccles, Tom: Union-closed families of sets. J. Combin. Theory Ser. A 120(3), 531\u2013544 (2013)","journal-title":"J. Combin. Theory Ser. A"},{"key":"2087_CR2","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.ejc.2014.08.030","volume":"43","author":"Henning Bruhn","year":"2015","unstructured":"Bruhn, Henning, Charbit, Pierre, Schaudt, Oliver, Telle, Jan\u00a0Arne: The graph formulation of the union-closed sets conjecture. Eur. J. Combin. 43, 210\u2013219 (2015)","journal-title":"Eur. J. Combin."},{"key":"2087_CR3","unstructured":"Bruhn, H., Schaudt, O.: The union-closed sets conjecture almost holds for almost all random bipartite graphs. In: The 7th European Conference on Combinatorics, Graph Theory and Applications, volume\u00a016 of CRM Series, pp. 79\u201384. Ed. Norm., Pisa, (2013)"},{"issue":"6","key":"2087_CR4","doi-asserted-by":"publisher","first-page":"2043","DOI":"10.1007\/s00373-014-1515-0","volume":"31","author":"H Bruhn","year":"2015","unstructured":"Bruhn, H., Schaudt, O.: The journey of the union-closed sets conjecture. Graphs Combin. 31(6), 2043\u20132074 (2015)","journal-title":"Graphs Combin."},{"issue":"1","key":"2087_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s11083-008-9105-5","volume":"26","author":"G Cz\u00e9dli","year":"2009","unstructured":"Cz\u00e9dli, G., Mar\u00f3ti, M., Schmidt, E.T.: On the scope of averaging for Frankl\u2019s conjecture. Order 26(1), 31\u201348 (2009)","journal-title":"Order"},{"issue":"1","key":"2087_CR6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.37236\/582","volume":"18","author":"V Falgas-Ravry","year":"2011","unstructured":"Falgas-Ravry, V.: Minimal weight in union-closed families. Electron. J. Combin. 18(1), 95 (2011)","journal-title":"Electron. J. Combin."},{"key":"2087_CR7","volume-title":"The Handbook of Combinatorics","author":"P Frankl","year":"1995","unstructured":"Frankl, P.: The Handbook of Combinatorics. MIT Press, Cambridge (1995). chapter 24"},{"key":"2087_CR8","unstructured":"Knill, E.: Graph generated union-closed families of sets (1994), \narXiv:math\/9409215v1\n\n [math.CO]"},{"issue":"1","key":"2087_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1017\/S0963548302005230","volume":"12","author":"D Reimer","year":"2003","unstructured":"Reimer, D.: An average set size theorem. Combin. Probab. Comput. 12(1), 89\u201393 (2003)","journal-title":"Combin. Probab. Comput."},{"key":"2087_CR10","first-page":"265","volume":"47","author":"I Roberts","year":"2010","unstructured":"Roberts, I., Simpson, J.: A note on the union-closed sets conjecture. Aust. J. Combin. 47, 265\u2013267 (2010)","journal-title":"Aust. J. Combin."},{"issue":"1\u20133","key":"2087_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0012-365X(98)00208-8","volume":"199","author":"P W\u00f3jcik","year":"1999","unstructured":"W\u00f3jcik, P.: Union-closed families of sets. Discr. Math. 199(1\u20133), 173\u2013182 (1999)","journal-title":"Discr. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02087-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02087-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02087-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T09:51:19Z","timestamp":1599731479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02087-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,10]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["2087"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02087-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2019,9,10]]},"assertion":[{"value":"2 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}