{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:29Z","timestamp":1740107129282,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T00:00:00Z","timestamp":1732060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T00:00:00Z","timestamp":1732060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s00373-024-02834-0","type":"journal-article","created":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T10:31:43Z","timestamp":1732098703000},"update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Several Minimality Concepts Related to Frankl\u2019s Conjecture"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-3994-5533","authenticated-orcid":false,"given":"Masahiro","family":"Hachimori","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenji","family":"Kashiwabara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,20]]},"reference":[{"key":"2834_CR1","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s000120050195","volume":"44","author":"T Abe","year":"2000","unstructured":"Abe, T.: Strong semimodular lattices and Frankl\u2019s conjecture. Algebra Universalis 44, 379\u2013382 (2000)","journal-title":"Algebra Universalis"},{"key":"2834_CR2","unstructured":"Alweiss, R., Huang, B., Sellke, M.: Improved lower bound for Frankl\u2019s union-closed sets conjecture (2022). arXiv:2211.11731"},{"key":"2834_CR3","doi-asserted-by":"publisher","first-page":"R88","DOI":"10.37236\/812","volume":"15","author":"I Bo\u0161njak","year":"2008","unstructured":"Bo\u0161njak, I., Markovi\u0107, P.: The 11-element case of Frankl\u2019s conjecture. Electron. J. Combin. 15, R88 (2008)","journal-title":"Electron. J. Combin."},{"key":"2834_CR4","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.ejc.2014.08.030","volume":"43","author":"H Bruhn","year":"2015","unstructured":"Bruhn, H., Charbit, P., Schaudt, O., Telle, J.A.: The graph formulation of the union-closed sets conjecture. Eur. J. Combin. 43, 210\u2013219 (2015)","journal-title":"Eur. J. Combin."},{"key":"2834_CR5","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, 2043\u20132074 (2015)","journal-title":"Graphs Combin."},{"key":"2834_CR6","unstructured":"Cambie, S.: Better bounds for the union-closed sets conjecture using the entropy approach (2022). arXiv:2212.12500"},{"key":"2834_CR7","unstructured":"Chase, Z., Lovett, S.: Approximate union closed conjecture (2022). arXiv:2211.11689"},{"key":"2834_CR8","unstructured":"Frankl, P.: Extremal set systems. In: The Handbook of Combinatorics, vol. II, pp. 1293\u20131329. MIT-Press, North-Holland (1995)"},{"key":"2834_CR9","unstructured":"Gilmer, J.: A constant lower bound for the union-closed sets conjecture (2022). arXiv:2211.09055"},{"key":"2834_CR10","doi-asserted-by":"crossref","unstructured":"Liu, J.: Improving the lower bound for the union-closed sets conjecture via conditionally IID coupling. In: 58th Annual Conference on Information Sciences and Systems (CISS). IEEE (2024)","DOI":"10.1109\/CISS59072.2024.10480167"},{"key":"2834_CR11","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1017\/S1446788700034133","volume":"55","author":"R Norton","year":"1993","unstructured":"Norton, R., Sarvate, D.: A note of the union-closed sets conjecture. J. Aust. Math. Soc. 55, 411\u2013413 (1993)","journal-title":"J. Aust. Math. Soc."},{"key":"2834_CR12","unstructured":"Pebody, L.: Extension of a method of Gilmer (2022). arXiv:2211.13139"},{"key":"2834_CR13","first-page":"265","volume":"47","author":"IT Roberts","year":"2010","unstructured":"Roberts, I.T., Simpson, J.: A note on the union-closed sets conjecture. Australas. J. Combin. 47, 265\u2013267 (2010)","journal-title":"Australas. J. Combin."},{"key":"2834_CR14","first-page":"149","volume":"27","author":"DG Sarvate","year":"1989","unstructured":"Sarvate, D.G., Renaud, J.C.: On the union-closed sets conjecture. Ars Combin. 27, 149\u2013154 (1989)","journal-title":"Ars Combin."},{"key":"2834_CR15","unstructured":"Sawin, W.: An improved lower bound for the union-closed set conjecture (2022). arXiv:2211.11504"},{"key":"2834_CR16","first-page":"65","volume":"13","author":"B Vu\u010dkovi\u0107","year":"2017","unstructured":"Vu\u010dkovi\u0107, B., \u017divkovi\u0107, M.: The 12-element case of Frankl\u2019s conjecture. IPSI Trans. Internet Res. 13, 65\u201371 (2017)","journal-title":"IPSI Trans. Internet Res."},{"key":"2834_CR17","doi-asserted-by":"publisher","first-page":"767","DOI":"10.3390\/e25050767","volume":"25","author":"L Yu","year":"2023","unstructured":"Yu, L.: Dimension-free bounds for the union-closed sets conjecture. Entropy 25, 767 (2023)","journal-title":"Entropy"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02834-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/article\/10.1007\/s00373-024-02834-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02834-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T20:07:50Z","timestamp":1733515670000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/s00373-024-02834-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,20]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2834"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s00373-024-02834-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,11,20]]},"assertion":[{"value":"20 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"130"}}