{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T15:29:09Z","timestamp":1768318149576,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s00493-023-00012-z","type":"journal-article","created":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T15:03:33Z","timestamp":1683039813000},"page":"187-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Sunflowers in Set Systems of Bounded Dimension"],"prefix":"10.1007","volume":"43","author":[{"given":"Jacob","family":"Fox","sequence":"first","affiliation":[]},{"given":"J\u00e1nos","family":"Pach","sequence":"additional","affiliation":[]},{"given":"Andrew","family":"Suk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,2]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0097-3165(72)90103-3","volume":"12","author":"HL Abbott","year":"1972","unstructured":"Abbott, H.L., Hanson, D., Sauer, N.: Intersection theorems for systems of sets. J. Combin. Theory Ser. A 12, 381\u2013389 (1972)","journal-title":"J. Combin. Theory Ser. A"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M., Szemer\u00e9di, E.: Crossing-free subgraphs, in: Theory and Practice of Combinatorics 60, Ann.\u00a0Discrete Math., North-Holland Math.\u00a0Stud. 12, North-Holland, Amsterdam, pp. 9\u201312 (1982)","DOI":"10.1016\/S0304-0208(08)73484-4"},{"key":"12_CR3","unstructured":"Alon, N., Holzman, R.: Near-sunflowers and focal families. Israel J. Math. (2020). https:\/\/doi.org\/10.48550\/arXiv.2010.05992"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Alon, N., Livni, R., Malliaris, M., Moran, S.: Private PAC learning implies finite Littlestone dimension, Proc.\u00a0STOC, pp. 852\u2013860 (2019)","DOI":"10.1145\/3313276.3316312"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"795","DOI":"10.4007\/annals.2021.194.3.5","volume":"194","author":"R Alweiss","year":"2021","unstructured":"Alweiss, R., Lovett, S., Wu, K., Zhang, J.: Improved bounds for the sunflower lemma. Ann. Math. 194, 795\u2013815 (2021)","journal-title":"Ann. Math."},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0012-365X(94)00185-L","volume":"138","author":"M Axenovich","year":"1995","unstructured":"Axenovich, M., Fon-Der-Flaass, D., Kostochka, A.: On set systems without weak 3-$$\\Delta $$-subsystems. Discrete Math. 138, 57\u201362 (1995)","journal-title":"Discrete Math."},{"key":"12_CR7","unstructured":"Ben-David, S., P\u00e1l, D., Shalev-Shwartz, S.: Agnostic online learning, in COLT, (2009)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Buzaglo, S., Holzman, R., Pinchasi, R.: On $$s$$-intersecting curves and related problems, Symposium on Computational Geometry, pp. 79\u201384 (2008)","DOI":"10.1145\/1377676.1377690"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1017\/bsl.2018.71","volume":"25","author":"H Chase","year":"2019","unstructured":"Chase, H., Freitag, J.: Model theory and machine learning. Bull. Symb. Log. 25, 319\u2013332 (2019)","journal-title":"Bull. Symb. Log."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L.: Applications of random sampling in computational geometry, II, Symposium on Computational Geometry, pp. 1\u201311 (1988)","DOI":"10.1145\/73393.73394"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF02579328","volume":"1","author":"M Deza","year":"1981","unstructured":"Deza, M., Frankl, P.: Every large set of equidistant $$(0,+1,-1)$$-vectors forms a sunflower. Combinatorica 1, 225\u2013231 (1981)","journal-title":"Combinatorica"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01305948","volume":"14","author":"G Ding","year":"1994","unstructured":"Ding, G., Seymour, P., Winkler, P.: Bounding the vertex cover number of a hypergraph. Combinatorica 14, 23\u201334 (1994)","journal-title":"Combinatorica"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1112\/jlms\/s1-35.1.85","volume":"35","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., Rado, R.: Intersection theorems for systems of sets. J. Lond. Math. Soc. 35, 85\u201390 (1960)","journal-title":"J. Lond. Math. Soc."},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0097-3165(78)90060-2","volume":"24","author":"P Erd\u0151s","year":"1978","unstructured":"Erd\u0151s, P., Szemer\u00e9di, E.: Combinatorial properties of systems of sets. J. Combin. Theory Ser. A 24, 308\u2013313 (1978)","journal-title":"J. Combin. Theory Ser. A"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1007\/s00454-018-0046-5","volume":"61","author":"J Fox","year":"2019","unstructured":"Fox, J., Pach, J., Suk, A.: Erd\u0151s-Hajnal conjecture for graphs with bounded VC-dimension. Discrete Comput. Geom. 61, 809\u2013829 (2019)","journal-title":"Discrete Comput. Geom."},{"key":"12_CR16","unstructured":"Fox, J., Pach, J., Suk, A.: Bounded VC-dimension implies the Schur-Erd\u0151s conjecture, Symposium on Computational Geometry, pp. 46:1\u201346:8 (2020)"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0097-3165(83)90038-9","volume":"34","author":"P Frankl","year":"1983","unstructured":"Frankl, P.: On the trace of finite sets. J. Combin. Theory Ser. A 34, 41\u201345 (1983)","journal-title":"J. Combin. Theory Ser. A"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1002\/(SICI)1098-2418(199608\/09)9:1\/2<213::AID-RSA13>3.0.CO;2-O","volume":"9","author":"AV Kostochka","year":"1996","unstructured":"Kostochka, A.V.: An intersection theorem for systems of sets. Random Struct. Algorithms 9, 213\u2013221 (1996)","journal-title":"Random Struct. Algorithms"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF00116827","volume":"2","author":"N Littlestone","year":"1987","unstructured":"Littlestone, N.: Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Mach. Learn. 2, 285\u2013318 (1987)","journal-title":"Mach. Learn."},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Naslund, E., Sawin, W.: Upper bounds for sunflower-free sets, Forum Math.\u00a0Sigma 5 (2017), Paper No. e15","DOI":"10.1017\/fms.2017.12"},{"key":"12_CR21","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033203","volume-title":"Combinatorial geometry","author":"J Pach","year":"1995","unstructured":"Pach, J., Agarwal, P.: Combinatorial geometry. Wiley-Interscience, New York (1995)"},{"key":"12_CR22","unstructured":"Rao, A.: Coding for sunflowers, Discrete Anal. (2020) Paper No. 2"},{"key":"12_CR23","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. Combinat. Theory Ser. A 13, 145\u2013147 (1972)","journal-title":"J. Combinat. Theory Ser. A"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/BF02574706","volume":"6","author":"M Sharir","year":"1991","unstructured":"Sharir, M.: On $$k$$-sets in arrangements of curves and surfaces. Discrete Comput. Geom. 6, 593\u2013617 (1991)","journal-title":"Discrete Comput. Geom."},{"key":"12_CR25","doi-asserted-by":"publisher","first-page":"247","DOI":"10.2140\/pjm.1972.41.247","volume":"41","author":"S Shelah","year":"1972","unstructured":"Shelah, S.: A combinatorial problem, stability and order for models and theories in infinitary languages. Pacific J. Math. 41, 247\u2013261 (1972)","journal-title":"Pacific J. Math."},{"key":"12_CR26","volume-title":"Classification theory and the number of non-isomorphic models","author":"S Shelah","year":"1978","unstructured":"Shelah, S.: Classification theory and the number of non-isomorphic models. North-Holland, Amsterdam (1978)"},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1017\/S0963548303005984","volume":"13","author":"S Smorodinsky","year":"2004","unstructured":"Smorodinsky, S., Sharir, M.: Selecting points that are heavily covered by pseudo-circles, spheres or rectangles. Combin. Probab. Comput. 13, 389\u2013411 (2004)","journal-title":"Combin. Probab. Comput."},{"key":"12_CR28","doi-asserted-by":"publisher","first-page":"249","DOI":"10.4153\/CMB-1977-038-7","volume":"20","author":"J Spencer","year":"1977","unstructured":"Spencer, J.: Intersection theorems for systems of sets. Canad. Math. Bull. 20, 249\u2013254 (1977)","journal-title":"Canad. Math. Bull."},{"key":"12_CR29","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V Vapnik","year":"1971","unstructured":"Vapnik, V., Chervonenkis, A.: On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16, 264\u2013280 (1971)","journal-title":"Theory Probab. Appl."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00012-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-023-00012-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00012-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T16:43:01Z","timestamp":1729356181000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-023-00012-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["12"],"URL":"https:\/\/doi.org\/10.1007\/s00493-023-00012-z","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2]]},"assertion":[{"value":"18 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}