{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T23:57:13Z","timestamp":1697673433907},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5221,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1999,4]]},"DOI":"10.1016\/s0012-365x(98)00313-6","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T16:52:26Z","timestamp":1053363146000},"page":"89-99","source":"Crossref","is-referenced-by-count":3,"title":["An inequality for the sizes of prime filters of finite distributive lattices"],"prefix":"10.1016","volume":"201","author":[{"given":"Dwight","family":"Duffus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bill","family":"Sands","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00313-6_BIB1","unstructured":"T. Abe, N. Nakano, Frankl's conjecture is true for modular lattices, Graphs and Combin., to appear."},{"key":"10.1016\/S0012-365X(98)00313-6_BIB2","author":"Borwein","year":"1987"},{"key":"10.1016\/S0012-365X(98)00313-6_BIB3","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-2226-1","article-title":"Means and their inequalities","author":"Bullen","year":"1988"},{"key":"10.1016\/S0012-365X(98)00313-6_BIB4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1080\/0020739860170303","article-title":"Which mean do you mean?","volume":"17","author":"Burrows","year":"1986","journal-title":"Int. J. Math. Educ. Sci. Technol."},{"key":"10.1016\/S0012-365X(98)00313-6_BIB5","first-page":"525","article-title":"problem proposed in Problem Session 1","author":"Duffus","year":"1985"},{"key":"10.1016\/S0012-365X(98)00313-6_BIB6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1002\/(SICI)1097-0118(199711)26:3<155::AID-JGT6>3.0.CO;2-Q","article-title":"A graph-theoretic version of the union-closed sets conjecture","volume":"26","author":"El-Zahar","year":"1997","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00313-6_BIB7","first-page":"199","article-title":"The average size of nonsingular sets in a graph, in Finite and Infinite Combinatorics in Sets and Logic","author":"Imrich","year":"1993"},{"key":"10.1016\/S0012-365X(98)00313-6_BIB8","series-title":"Graph generated union-closed families of sets","author":"Knill","year":"1993"},{"key":"10.1016\/S0012-365X(98)00313-6_BIB9","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0097-3165(85)90087-1","article-title":"Every poset has a central element","volume":"40","author":"Linial","year":"1985","journal-title":"J. Combin. Theory, Ser. A"},{"key":"10.1016\/S0012-365X(98)00313-6_BIB10","first-page":"15","article-title":"Around Frank1 conjecture","volume":"43","author":"Nishimura","year":"1996","journal-title":"Sci. Rep. Yokahama Nat. Univ. Sect. I: Math. Phys. Chem."},{"key":"10.1016\/S0012-365X(98)00313-6_BIB11","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0097-3165(92)90068-6","article-title":"Union-closed families","volume":"59","author":"Poonen","year":"1992","journal-title":"J. Combin. Theory, Ser. A"},{"key":"10.1016\/S0012-365X(98)00313-6_BIB12","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0012-365X(81)90210-7","article-title":"Counting antichains in finite partially ordered sets","volume":"35","author":"Sands","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00313-6_BIB13","first-page":"149","article-title":"On the union-closed conjecture","volume":"27","author":"Sarvate","year":"1989","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(98)00313-6_BIB14","first-page":"181","article-title":"Improved bounds for the union-closed conjecture","volume":"29","author":"Sarvate","year":"1990","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(98)00313-6_BIB15","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0012-365X(92)90148-9","article-title":"Density of union-closed families","volume":"105","author":"W\u00f3jcik","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00313-6_BIB16","series-title":"Union-closed families of sets","author":"W\u00f3jcik","year":"1997"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98003136?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98003136?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:24:39Z","timestamp":1556666679000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98003136"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["S0012365X98003136"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00313-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}