{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:46:33Z","timestamp":1740109593096,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T00:00:00Z","timestamp":1690156800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T00:00:00Z","timestamp":1690156800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1855464"],"award-info":[{"award-number":["1855464"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s00454-023-00521-0","type":"journal-article","created":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T15:02:27Z","timestamp":1690210947000},"page":"476-482","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Implicit Representation of Sparse Hereditary Families"],"prefix":"10.1007","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1332-4883","authenticated-orcid":false,"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,24]]},"reference":[{"issue":"2","key":"521_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1515\/dma.1993.3.2.191","volume":"3","author":"VE Alekseev","year":"1993","unstructured":"Alekseev, V.E.: On the entropy values of hereditary classes of graphs. Discrete Math. Appl. 3(2), 191\u2013199 (1993)","journal-title":"Discrete Math. Appl."},{"issue":"1","key":"521_CR2","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1112\/S0025579300013875","volume":"33","author":"N Alon","year":"1986","unstructured":"Alon, N.: The number of polytopes, configurations and real matroids. Mathematika 33(1), 62\u201371 (1986)","journal-title":"Mathematika"},{"key":"521_CR3","unstructured":"Alon, N.: Tools from higher algebra. In: Handbook of Combinatorics, Vol.\u00a02, pp. 1749\u20131783. North Holland, Amsterdam (1995)"},{"issue":"1","key":"521_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00039-017-0396-9","volume":"27","author":"N Alon","year":"2017","unstructured":"Alon, N.: Asymptotically optimal induced universal graphs. Geom. Funct. Anal. 27(1), 1\u201332 (2017)","journal-title":"Geom. Funct. Anal."},{"issue":"2","key":"521_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jctb.2010.10.001","volume":"101","author":"N Alon","year":"2011","unstructured":"Alon, N., Balogh, J., Bollob\u00e1s, B., Morris, R.: The structure of almost all graphs in a hereditary property. J. Comb. Theory Ser. B 101(2), 85\u2013110 (2011)","journal-title":"J. Comb. Theory Ser. B"},{"key":"521_CR6","doi-asserted-by":"crossref","unstructured":"Alon, N., Moran, S., Yehudayoff, A.: Sign rank versus Vapnik\u2013Chervonenkis dimension. Sb. Math. 208(12), 1724\u20131757 (2017)","DOI":"10.1070\/SM8780"},{"issue":"2","key":"521_CR7","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jctb.1999.1906","volume":"76","author":"N Alon","year":"1999","unstructured":"Alon, N., R\u00f3nyai, L., Szab\u00f3, T.: Norm-graphs: variations and applications. J. Comb. Theory Ser. B 76(2), 280\u2013290 (1999)","journal-title":"J. Comb. Theory Ser. B"},{"key":"521_CR8","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B., Thomason, A.: Hereditary and monotone properties of graphs. In: The Mathematics of Paul Erd\u0151s, vol.\u00a02. Algorithms Combin., vol. 14, pp. 70\u201378. Springer, Berlin (1997)","DOI":"10.1007\/978-3-642-60406-5_7"},{"key":"521_CR9","doi-asserted-by":"crossref","unstructured":"Bonamy, M., Esperet, L., Groenland, C., Scott, A.: Optimal labelling schemes for adjacency, comparability, and reachability. In: 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 1109\u20131117. ACM, New York (2021)","DOI":"10.1145\/3406325.3451102"},{"issue":"5","key":"521_CR10","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02187743","volume":"4","author":"B Chazelle","year":"1989","unstructured":"Chazelle, B., Welzl, E.: Quasi-optimal range searching in spaces of finite VC-dimension. Discrete Comput. Geom. 4(5), 467\u2013489 (1989)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"521_CR11","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF02187696","volume":"1","author":"JE Goodman","year":"1986","unstructured":"Goodman, J.E., Pollack, R.: Upper bounds for configurations and polytopes in $$\\textbf{R} ^d$$. Discrete Comput. Geom. 1(3), 219\u2013227 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"521_CR12","doi-asserted-by":"crossref","unstructured":"Hatami, H., Hatami, P.: The implicit graph conjecture is false. In: IEEE 63rd Annual Symposium on Foundations of Computer Science (Denver 2022), pp. 1134\u20131137. IEEE Computer Soc., Los Alamitos (2022)","DOI":"10.1109\/FOCS54457.2022.00109"},{"issue":"2","key":"521_CR13","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0097-3165(95)90052-7","volume":"69","author":"D Haussler","year":"1995","unstructured":"Haussler, D.: Sphere packing numbers for subsets of the Boolean $$n$$-cube with bounded Vapnik\u2013Chervonenkis dimension. J. Comb. Theory Ser. A 69(2), 217\u2013232 (1995)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"4","key":"521_CR14","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1137\/0405049","volume":"5","author":"S Kannan","year":"1992","unstructured":"Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. SIAM J. Discrete Math. 5(4), 596\u2013603 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"521_CR15","doi-asserted-by":"publisher","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","volume":"3","author":"T K\u00f6vari","year":"1954","unstructured":"K\u00f6vari, T., S\u00f3s, V.T., Tur\u00e1n, P.: On a problem of K. Zarankiewicz. Colloq. Math. 3, 50\u201357 (1954)","journal-title":"Zarankiewicz. Colloq. Math."},{"issue":"4","key":"521_CR16","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/BF01303517","volume":"13","author":"J Matou\u0161ek","year":"1993","unstructured":"Matou\u0161ek, J., Welzl, E., Wernisch, L.: Discrepancy and approximations for bounded VC-dimension. Combinatorica 13(4), 455\u2013466 (1993)","journal-title":"Combinatorica"},{"issue":"1","key":"521_CR17","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.jctb.2012.09.004","volume":"103","author":"C McDiarmid","year":"2013","unstructured":"McDiarmid, C., M\u00fcller, T.: Integer realizations of disk and segment graphs. J. Comb. Theory Ser. B 103(1), 114\u2013143 (2013)","journal-title":"J. Comb. Theory Ser. B"},{"key":"521_CR18","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9939-1964-0161339-9","volume":"15","author":"J Milnor","year":"1964","unstructured":"Milnor, J.: On the Betti numbers of real varieties. Proc. Am. Math. Soc. 15, 275\u2013280 (1964)","journal-title":"Proc. Am. Math. Soc."},{"issue":"1","key":"521_CR19","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1017\/S2040618500035139","volume":"7","author":"JW Moon","year":"1965","unstructured":"Moon, J.W.: On minimal $$n$$-universal graphs. Proc. Glasgow Math. Assoc. 7(1), 32\u201333 (1965)","journal-title":"Proc. Glasgow Math. Assoc."},{"key":"521_CR20","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","volume":"13","author":"N Sauer","year":"1972","unstructured":"Sauer, N.: On the density of families of sets. J. Comb. Theory Ser. A 13, 145\u2013147 (1972)","journal-title":"J. Comb. Theory Ser. A"},{"key":"521_CR21","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1090\/S0002-9947-1968-0226281-1","volume":"133","author":"HE Warren","year":"1968","unstructured":"Warren, H.E.: Lower bounds for approximation by nonlinear manifolds. Trans. Am. Math. Soc. 133, 167\u2013178 (1968)","journal-title":"Trans. Am. Math. Soc."},{"key":"521_CR22","doi-asserted-by":"crossref","unstructured":"Welzl, E.: Partition trees for triangle counting and other range searching problems. In: 4th Annual Symposium on Computational Geometry (Urbana 1988), pp. 23\u201333. ACM, New York (1988)","DOI":"10.1145\/73393.73397"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00521-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-023-00521-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00521-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T23:04:51Z","timestamp":1727391891000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-023-00521-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,24]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["521"],"URL":"https:\/\/doi.org\/10.1007\/s00454-023-00521-0","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2023,7,24]]},"assertion":[{"value":"16 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}