{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:43:26Z","timestamp":1781077406693,"version":"3.54.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,5,16]],"date-time":"2014-05-16T00:00:00Z","timestamp":1400198400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s00373-014-1448-7","type":"journal-article","created":{"date-parts":[[2014,5,15]],"date-time":"2014-05-15T05:37:07Z","timestamp":1400132227000},"page":"1335-1346","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Erd\u0151s\u2013Pyber Theorem for Hypergraphs and Secret Sharing"],"prefix":"10.1007","volume":"31","author":[{"given":"L\u00e1szl\u00f3","family":"Csirmaz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P\u00e9ter","family":"Ligeti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G\u00e1bor","family":"Tardos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,5,16]]},"reference":[{"issue":"3","key":"1448_CR1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02579381","volume":"2","author":"N Alon","year":"1986","unstructured":"Alon, N.: Covering graphs by the minimum number of equivalence relations. Combinatorica 2(3), 201\u2013206 (1986)","journal-title":"Combinatorica"},{"key":"1448_CR2","doi-asserted-by":"crossref","unstructured":"Beimel, A., Ferr\u00e0s, O., Mintz, Y.: Secret Sharing Schemes for Very Dense Graphs, Lecture Notes in Computer Science, vol. 7417 (Advances in Cryptology\u2014CRYPTO 2012), pp. 144\u2013161, ISSN: 0302\u20139743 (2012)","DOI":"10.1007\/978-3-642-32009-5_10"},{"key":"1448_CR3","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/j.disc.2006.11.045","volume":"208","author":"S Bezrukov","year":"2008","unstructured":"Bezrukov, S., Fron\u010dek, D., Rosenberg, S.J., Kov\u00e1r, P.: On biclicque coverings. Discret. Math. 208, 319\u2013323 (2008)","journal-title":"Discret. Math."},{"key":"1448_CR4","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Merwin, R.E., Zanca, J.T., Smith, M. (eds.) Proceedings of the 1979 IFIPS National Computer Conference, vol. 48, pp. 313\u2013317 (1979)"},{"key":"1448_CR5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1008216403325","volume":"11","author":"C Blundo","year":"1997","unstructured":"Blundo, C., De Santis, A., De Simone, R., Vaccaro, U.: Tight bounds on the information rate of secret sharing schemes. Des. Codes Cryptogr. 11, 107\u2013122 (1997)","journal-title":"Des. Codes Cryptogr."},{"key":"1448_CR6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00373-007-0722-3","volume":"23","author":"J Dong","year":"2007","unstructured":"Dong, J., Liu, Y.: On the decomposition of graphs into complete bipartite graphs. Graph. Combin. 23, 255\u2013262 (2007)","journal-title":"Graph. Combin."},{"issue":"1\u20133","key":"1448_CR7","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0012-365X(96)00124-0","volume":"170","author":"P Erd\u0151s","year":"1997","unstructured":"Erd\u0151s, P., Pyber, L.: Covering a graph by complete bipartite graphs. Discret. Math. 170(1\u20133), 249\u2013251 (1997)","journal-title":"Discret. Math."},{"key":"1448_CR8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0012-365X(95)00154-O","volume":"160","author":"PC Fishburn","year":"1996","unstructured":"Fishburn, P.C., Hammer, P.L.: Bipartite dimensions and bipartite degrees of graphs. Discret. Math. 160, 127\u2013148 (1996)","journal-title":"Discret. Math."},{"key":"1448_CR9","unstructured":"Hajuabolhassan, H., Moazami, F.: Some New Bounds for Cover-Free Families Through Biclique Cover, arXiv:1008.3691 (2011), Accessed Nov 2013"},{"key":"1448_CR10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/jgt.20367","volume":"61","author":"S Jukna","year":"2009","unstructured":"Jukna, S.: On set intersection representation of graphs. J. Graph. Theor. 61, 55\u201375 (2009)","journal-title":"J. Graph. Theor."},{"key":"1448_CR11","first-page":"23","volume":"2","author":"G Katona","year":"1967","unstructured":"Katona, G., Szemer\u00e9di, E.: On a problem of graph theory. Studia Math. Hung. 2, 23\u201328 (1967)","journal-title":"Studia Math. Hung."},{"key":"1448_CR12","unstructured":"Kanuer, K., Ueckerdt, T.: Three Ways to Cover a Graph arXiv:1205.1627 (2012), Accessed Nov 2013"},{"key":"1448_CR13","unstructured":"Padro, C.: Lecture Notes in Secret Sharing IACR preprint http:\/\/eprint.iacr.org\/2012\/674 (2012) Accessed Nov 2013"},{"key":"1448_CR14","doi-asserted-by":"crossref","unstructured":"Pinto, T.: Biclique Covers and Partitions, arXiv:1307.6363 (2013), Accessed Nov 2013","DOI":"10.37236\/3595"},{"key":"1448_CR15","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22, 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"1448_CR16","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/18.272461","volume":"40","author":"DR Stinson","year":"1994","unstructured":"Stinson, D.R.: Decomposition construction for secret sharing schemes. IEEE Trans. Inf. Theory 40, 118\u2013125 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1448_CR17","doi-asserted-by":"crossref","unstructured":"Watts, V.L.: Fractional biclique covers and partitions of graphs. Electron. J. Combin. 13, R74 (2006)","DOI":"10.37236\/1100"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1448-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1448-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1448-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,19]],"date-time":"2020-08-19T12:31:45Z","timestamp":1597840305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1448-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,16]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["1448"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1448-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,16]]}}}