{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T13:23:51Z","timestamp":1767014631402,"version":"3.48.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T00:00:00Z","timestamp":1762473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T00:00:00Z","timestamp":1762473600000},"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":[[2025,12]]},"DOI":"10.1007\/s00493-025-00190-y","type":"journal-article","created":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:20:50Z","timestamp":1762521650000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Largest Subgraph Without A Forbidden Induced Subgraph"],"prefix":"10.1007","volume":"45","author":[{"given":"Jacob","family":"Fox","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajko","family":"Nenadov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huy Tuan","family":"Pham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,7]]},"reference":[{"key":"190_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s003730200002","volume":"18","author":"N Alon","year":"2002","unstructured":"Alon, N., Hoory, S., Linial, N.: The Moore bound for irregular graphs. Graphs Combin. 18, 53\u201357 (2002)","journal-title":"Graphs Combin."},{"key":"190_CR2","doi-asserted-by":"crossref","unstructured":"Alon,N., Krivelevich,M., Samotij,W.: Largest subgraph from a hereditary property in a random graph, Discrete Math. 346 (2023), Paper No. 113480","DOI":"10.1016\/j.disc.2023.113480"},{"key":"190_CR3","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1017\/S0963548303005741","volume":"12","author":"N Alon","year":"2003","unstructured":"Alon, N., Krivelevich, M., Sudakov, B.: Tur\u00e1n numbers of bipartite graphs and related Ramsey-type questions. Combin. Probab. Comput. 12, 477\u2013494 (2003)","journal-title":"Combin. Probab. Comput."},{"key":"190_CR4","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. Combin. Theory Ser. B 76, 280\u2013290 (1999)","journal-title":"J. Combin. Theory Ser. B"},{"key":"190_CR5","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/j.dam.2024.10.007","volume":"360","author":"M Axenovich","year":"2025","unstructured":"Axenovich, M., Zimmermann, J.: Induced Tur\u00e1n problem in bipartite graphs. Discret. Appl. Math. 360, 497\u2013505 (2025)","journal-title":"Discret. Appl. Math."},{"key":"190_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02122551","volume":"8","author":"B Bollob\u00e1s","year":"1988","unstructured":"Bollob\u00e1s, B.: The chromatic number of random graphs. Combinatorica 8, 49\u201355 (1988)","journal-title":"Combinatorica"},{"key":"190_CR7","doi-asserted-by":"crossref","unstructured":"Bourneuf,R., Buci\u0107,M., Cook,L., Davies,J.: On polynomial degree-boundedness, Adv. Comb., 2024:5, 16 pp","DOI":"10.19086\/aic.2024.5"},{"key":"190_CR8","doi-asserted-by":"publisher","first-page":"2039","DOI":"10.1215\/00127094-2023-0043","volume":"173","author":"B Bukh","year":"2024","unstructured":"Bukh, B.: Extremal graphs without exponentially small bicliques. Duke Math. J. 173, 2039\u20132062 (2024)","journal-title":"Duke Math. J."},{"key":"190_CR9","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/s00493-020-4516-z","volume":"41","author":"D Di Benedetto","year":"2021","unstructured":"Di Benedetto, D., Solymosi, J., White, E.P.: On the directions determined by a Cartesian product in an affine Galois plane. Combinatorica 41, 755\u2013763 (2021)","journal-title":"Combinatorica"},{"key":"190_CR10","unstructured":"Clifton,A., Liu,H., Mattos,L., Zheng,M.: Subgraphs of random graphs in hereditary families, arXiv:2405.09486"},{"key":"190_CR11","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1007\/s00039-010-0097-0","volume":"20","author":"D Conlon","year":"2010","unstructured":"Conlon, D., Fox, J., Sudakov, B.: An approximate version of Sidorenko\u2019s conjecture. Geom. Funct. Anal. 20, 1354\u20131366 (2010)","journal-title":"Geom. Funct. Anal."},{"key":"190_CR12","unstructured":"Ding,L., Gao,J., Liu,H., Luan,B., Sun,S.: Induced even cycles in locally sparse graphs, arXiv:2411.12659"},{"key":"190_CR13","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.jctb.2025.04.002","volume":"173","author":"X Du","year":"2025","unstructured":"Du, X., Gir\u00e3o, A., Hunter, Z., McCarty, R., Scott, A.: Induced $$C_4$$-free subgraphs with large average degree. J. Combinatorial Theory Ser. B 173, 305\u2013328 (2025)","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"190_CR14","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1016\/j.dam.2010.09.005","volume":"161","author":"A Dudek","year":"2013","unstructured":"Dudek, A., Frankl, P., R\u00f6dl, V.: Some recent results on Ramsey-type numbers. Discrete Appl. Math. 161, 1197\u20131202 (2013)","journal-title":"Discrete Appl. Math."},{"key":"190_CR15","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1090\/S0002-9904-1946-08715-7","volume":"52","author":"P Erd\u0151s","year":"1946","unstructured":"Erd\u0151s, P., Stone, A.M.: On the structure of linear graphs. Bull. Amer. Math. Soc. 52, 1087\u20131091 (1946)","journal-title":"Bull. Amer. Math. Soc."},{"key":"190_CR16","first-page":"51","volume":"1","author":"P Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., Simonovits, M.: A limit theorem in graph theory. Studia Sci. Math. Hungar. 1, 51\u201357 (1966)","journal-title":"Studia Sci. Math. Hungar."},{"key":"190_CR17","doi-asserted-by":"crossref","unstructured":"Fox,J., Pach,J., Suk,A.: Quasiplanar graphs, string graphs, and the Erd\u00f6s-Gallai problem, Graph drawing and network visualization, 219\u2013231. Lecture Notes in Comput. Sci., 13764 Springer, Cham, 2023","DOI":"10.1007\/978-3-031-22203-0_16"},{"key":"190_CR18","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00493-009-2475-5","volume":"29","author":"J Fox","year":"2009","unstructured":"Fox, J., Sudakov, B.: Density theorems for bipartite graphs and related Ramsey-type results. Combinatorica 29, 153\u2013196 (2009)","journal-title":"Combinatorica"},{"key":"190_CR19","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1002\/rsa.20344","volume":"38","author":"J Fox","year":"2011","unstructured":"Fox, J., Sudakov, B.: Dependent random choice. Random Structures Algorithms 38, 68\u201399 (2011)","journal-title":"Random Structures Algorithms"},{"key":"190_CR20","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF01375476","volume":"11","author":"Z F\u00fcredi","year":"1991","unstructured":"F\u00fcredi, Z.: On a Tur\u00e1n type problem of Erd\u0151s. Combinatorica 11, 75\u201379 (1991)","journal-title":"Combinatorica"},{"key":"190_CR21","doi-asserted-by":"crossref","unstructured":"F\u00fcredi,Z., Simonovits,M.: The history of degenerate (bipartite) extremal graph problems, in Erd\u0151s centennial, Bolyai Soc. Math. Stud., vol. 25 (J\u00e1nos Bolyai Math. Soc., Budapest, 2013), pp. 169\u2013264","DOI":"10.1007\/978-3-642-39286-3_7"},{"key":"190_CR22","doi-asserted-by":"crossref","unstructured":"Gir\u00e3o,A., Hunter,Z.: Induced subdivisions in $$K_{s,s}$$-free graphs with polynomial average degree, Int. Math. Res. Not. 2025, No. 4, Article ID rnaf025","DOI":"10.1093\/imrn\/rnaf025"},{"key":"190_CR23","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0012-365X(83)90019-5","volume":"43","author":"MC Golumbic","year":"1983","unstructured":"Golumbic, M.C., Rotem, D., Urrutia, J.: Comparability graphs and intersection graphs. Discrete Math. 43, 37\u201346 (1983)","journal-title":"Discrete Math."},{"key":"190_CR24","unstructured":"Graham,R.\u00a0L., Rothschild,B.\u00a0L., Spencer,J.\u00a0H.: Ramsey theory, volume\u00a020. John Wiley & Sons, 1991"},{"key":"190_CR25","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1112\/plms.12322","volume":"122","author":"B Hanson","year":"2021","unstructured":"Hanson, B., Petridis, G.: Refined estimates concerning sumsets contained in the roots of unity. Proc. Lond. Math. Soc.(3) 122, 353\u2013358 (2021)","journal-title":"Proc. Lond. Math. Soc.(3)"},{"key":"190_CR26","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.jctb.2024.12.009","volume":"172","author":"Z Hunter","year":"2025","unstructured":"Hunter, Z., Milojevi\u0107, A., Sudakov, B., Tomon, I.: K\u0151vari-S\u00f3s-Tur\u00e1n theorem for hereditary families. J. Combinatorial Theory Ser. B 172, 168\u2013197 (2025)","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"190_CR27","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF01261323","volume":"16","author":"J Koll\u00e1r","year":"1996","unstructured":"Koll\u00e1r, J., R\u00f3nyai, L., Szab\u00f3, T.: Norm-graphs and bipartite Tur\u00e1n numbers. Combinatorica 16, 399\u2013406 (1996)","journal-title":"Combinatorica"},{"key":"190_CR28","doi-asserted-by":"crossref","unstructured":"K\u0151v\u00e1ri,T., S\u00f3s,V. T., Tur\u00e1n,P.: On a problem of K. Zarankiewicz, Colloq. Math. 3 (1954), 50\u201357","DOI":"10.4064\/cm-3-1-50-57"},{"key":"190_CR29","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s00493-004-0017-8","volume":"24","author":"D K\u00fchn","year":"2004","unstructured":"K\u00fchn, D., Osthus, D.: Induced subdivisions in $$K_{s, s}$$-free graphs of large average degree. Combinatorica 24, 287\u2013304 (2004)","journal-title":"Combinatorica"},{"key":"190_CR30","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1017\/S0963548317000542","volume":"27","author":"P-S Loh","year":"2018","unstructured":"Loh, P.-S., Tait, M., Timmons, C., Zhou, R.M.: Induced Tur\u00e1n numbers. Combin. Probab. Comput. 27, 274\u2013288 (2018)","journal-title":"Combin. Probab. Comput."},{"key":"190_CR31","unstructured":"Lov\u00e1sz,L.: Perfect graphs, in: Selected Topics in Graph Theory, vol. 2, Academic Press, London, 1983, 55\u201387"},{"key":"190_CR32","unstructured":"Milojevi\u0107,A., Sudakov,B., Tomon,I.: Incidence bounds via extremal graph theory, arXiv:2401.06670"},{"key":"190_CR33","unstructured":"Milojevi\u0107,A., Sudakov,B., Tomon,I.: Point-variety incidences, unit distances and Zarankiewicz\u2019s problem for algebraic graphs, arXiv:2403.08756"},{"key":"190_CR34","first-page":"150","volume":"15","author":"J Pach","year":"2006","unstructured":"Pach, J., T\u00f3th, G.: Comment on Fox News. Geombinatorics 15, 150\u2013154 (2006)","journal-title":"Geombinatorics"},{"issue":"1\u20133","key":"190_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000010","volume":"7","author":"SP Vadhan","year":"2012","unstructured":"Vadhan, S.P.: Pseudorandomness. Foundations and Trends in Theoretical Computer Science 7(1\u20133), 1\u2013336 (2012)","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"190_CR36","doi-asserted-by":"crossref","unstructured":"Yip,C. H.: On the clique number of Paley graphs and generalized Paley graphs, MSc thesis, University of British Columbia (2021)","DOI":"10.1016\/j.ffa.2021.101930"},{"key":"190_CR37","unstructured":"Zimmermann,J.: Induced Tur\u00e1n problems, BSc thesis, Karlsruhe Institute of Technology (2024)"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-025-00190-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-025-00190-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-025-00190-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T13:18:01Z","timestamp":1767014281000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-025-00190-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,7]]},"references-count":37,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["190"],"URL":"https:\/\/doi.org\/10.1007\/s00493-025-00190-y","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"type":"print","value":"0209-9683"},{"type":"electronic","value":"1439-6912"}],"subject":[],"published":{"date-parts":[[2025,11,7]]},"assertion":[{"value":"7 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"60"}}