{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:44:24Z","timestamp":1775054664222,"version":"3.50.1"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2001,10,8]],"date-time":"2001-10-08T00:00:00Z","timestamp":1002499200000},"content-version":"unspecified","delay-in-days":99,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2001,7]]},"abstract":"<jats:p>A family of subsets of an <jats:italic>n<\/jats:italic>-set is <jats:italic>k<\/jats:italic>-locally thin if, for every <jats:italic>k<\/jats:italic>-tuple of its members, the \nground set has at least one element contained in exactly one of them. For <jats:italic>k<\/jats:italic> = 5 we derive a \nnew exponential upper bound for the maximum size of these families. This implies the same \nbound for all odd values of <jats:italic>k<\/jats:italic> &gt; 3. Our proof uses the graph entropy bounding technique to \nexploit a self-similarity in the structure of the hypergraph associated with such set families.<\/jats:p>","DOI":"10.1017\/s0963548301004667","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T13:19:50Z","timestamp":1027775990000},"page":"309-315","source":"Crossref","is-referenced-by-count":2,"title":["Self-Similarity Bounds for Locally Thin Set Families"],"prefix":"10.1017","volume":"10","author":[{"given":"EMANUELA","family":"FACHINI","sequence":"first","affiliation":[]},{"given":"J\u00c1NOS","family":"K\u00d6RNER","sequence":"additional","affiliation":[]},{"given":"ANGELO","family":"MONTI","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2001,10,8]]},"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548301004667","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T19:37:48Z","timestamp":1553974668000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548301004667\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0963548301004667"],"URL":"https:\/\/doi.org\/10.1017\/s0963548301004667","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}