{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:36:53Z","timestamp":1772725013258,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,5,10]],"date-time":"2016-05-10T00:00:00Z","timestamp":1462838400000},"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":["Combinatorica"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s00493-015-3290-9","type":"journal-article","created":{"date-parts":[[2016,5,9]],"date-time":"2016-05-09T21:43:38Z","timestamp":1462830218000},"page":"617-632","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["The typical structure of graphs with no large cliques"],"prefix":"10.1007","volume":"37","author":[{"given":"J\u00f3zsef","family":"Balogh","sequence":"first","affiliation":[]},{"given":"Neal","family":"Bushaw","sequence":"additional","affiliation":[]},{"given":"Maur\u00edcio","family":"Collares","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Morris","sequence":"additional","affiliation":[]},{"given":"Maryam","family":"Sharifzadeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,10]]},"reference":[{"key":"3290_CR1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.jctb.2010.10.001","volume":"101","author":"N. Alon","year":"2011","unstructured":"N. Alon, J. Balogh, B. Bollob\u00e1s and R. Morris: The structure of almost all graphs in a hereditary property, J. Combin. Theory, Ser. B\n101 (2011), 85\u2013110.","journal-title":"J. Combin. Theory, Ser. B"},{"key":"3290_CR2","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1112\/S0024610704005563","volume":"70","author":"N. Alon","year":"2004","unstructured":"N. Alon, J. Balogh, P. Keevash and B. Sudakov: The number of edge colorings with no monochromatic cliques, J. London Math. Soc.\n70 (2004), 273\u2013288.","journal-title":"J. London Math. Soc."},{"key":"3290_CR3","doi-asserted-by":"crossref","DOI":"10.1002\/9780470277331","volume-title":"The probabilistic method","author":"N. Alon","year":"2008","unstructured":"N. Alon and J.H. Spencer: The probabilistic method, 3rd edition, Wiley, New York, (2008).","edition":"3"},{"key":"3290_CR4","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1002\/rsa.20353","volume":"38","author":"J. Balogh","year":"2011","unstructured":"J. Balogh and J. Butterfield: Excluding induced subgraphs: critical graphs, Random Structures Algorithms\n38 (2011), 100\u2013120.","journal-title":"Random Structures Algorithms"},{"key":"3290_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jctb.2003.08.001","volume":"91","author":"J. Balogh","year":"2004","unstructured":"J. Balogh, B. Bollob\u00e1s and M. Simonovits: The number of graphs without forbidden subgraphs, J. Combin. Theory, Ser. B\n91 (2004), 1\u201324.","journal-title":"J. Combin. Theory, Ser. B"},{"key":"3290_CR6","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/rsa.20242","volume":"34","author":"J. Balogh","year":"2009","unstructured":"J. Balogh, B. Bollob\u00e1s and M. Simonovits: The typical structure of graphs without given excluded subgraphs, Random Structures Algorithms\n34 (2009), 305\u2013318.","journal-title":"Random Structures Algorithms"},{"key":"3290_CR7","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1090\/S0894-0347-2014-00816-X","volume":"28","author":"J. Balogh","year":"2015","unstructured":"J. Balogh, R. Morris and W. Samotij: Independent sets in hypergraphs, J. Amer. Math. Soc\n28 (2015), 669\u2013709.","journal-title":"J. Amer. Math. Soc"},{"key":"3290_CR8","unstructured":"J. Balogh, R. Morris, W. Samotij and L. Warnke: The typical structure of sparse K\n                                    \n                                        r+1-free graphs, to appear in Trans. Amer. Math. Soc."},{"key":"3290_CR9","doi-asserted-by":"crossref","first-page":"1964","DOI":"10.1016\/j.ejc.2010.05.005","volume":"32","author":"B. Bollob\u00e1s","year":"2010","unstructured":"B. Bollob\u00e1s and V. Nikiforov: The number of graphs with large forbidden subgraphs, European J. Combin.\n32 (2010), 1964\u20131968.","journal-title":"European J. Combin."},{"key":"3290_CR10","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1112\/blms\/27.5.417","volume":"27","author":"B. Bollob\u00e1s","year":"1995","unstructured":"B. Bollob\u00e1s and A. Thomason: Projections of bodies and hereditary properties of hypergraphs, Bull. London Math. Soc.\n27 (1995) 417\u2013424.","journal-title":"Bull. London Math. Soc."},{"key":"3290_CR11","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02759942","volume":"2","author":"P. Erd\u0151s","year":"1964","unstructured":"P. Erd\u0151s: On extremal problems of graphs and generalized graphs, Israel J. Math.\n2 (1964), 183\u2013190.","journal-title":"Israel J. Math."},{"key":"3290_CR12","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01788085","volume":"2","author":"P. Erd\u0151s","year":"1986","unstructured":"P. Erd\u0151s, P. Frankl and V. R\u00f6dl: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent, Graphs Combin.\n2 (1986), 113\u2013121.","journal-title":"Graphs Combin."},{"key":"3290_CR13","volume-title":"Colloquio Internazionale sulle Teorie Combinatorie","author":"P. Erd\u0151s","year":"1973","unstructured":"P. Erd\u0151s, D. J. Kleitman and B.L. Rothschild: Asymptotic enumeration of K\nn-free graphs, Colloquio Internazionale sulle Teorie Combinatorie (Rome, (1973)), Tomo II, 19-27. Atti dei Convegni Lincei, No. 17, Accad. Naz. Lincei, Rome, (1976)."},{"key":"3290_CR14","first-page":"51","volume":"1","author":"P. Erd\u0151s","year":"1966","unstructured":"P. Erd\u0151s and M. Simonovits: A limit theorem in graph theory, Studia Sci. Math. Hungar.\n1 (1966), 51\u201357.","journal-title":"Studia Sci. Math. Hungar."},{"key":"3290_CR15","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"P. Erd\u0151s and G. Szekeres: A combinatorial problem in geometry, Compos. Math.\n2 (1935), 463\u2013470.","journal-title":"Compos. Math."},{"key":"3290_CR16","unstructured":"Z. F\u00fcredi: A proof of the stability of extremal graphs, Simonovits\u2019 stability from Szemer\u00e9di\u2019s regularity, arXiv:1501.03129."},{"key":"3290_CR17","first-page":"637","volume":"303","author":"P. G. Kolaitis","year":"1987","unstructured":"P. G. Kolaitis, H. J. Pr\u00f6mel and B. L. Rothschild: K\n                                        l+1-free graphs: asymptotic structure and a 0-1 law, Trans. Amer. Math. Soc.\n                                    303 (1987), 637\u2013671.","journal-title":"Trans. Amer. Math. Soc."},{"key":"3290_CR18","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/978-3-0348-5438-2_41","volume-title":"Studies in pure mathematics","author":"L. Lov\u00e1sz","year":"1983","unstructured":"L. Lov\u00e1sz and M. Simonovits: On the number of complete subgraphs of a graph, II, Studies in pure mathematics, Birkhuser (1983), 459\u2013495."},{"key":"3290_CR19","first-page":"60","volume":"10","author":"W. Mantel","year":"1907","unstructured":"W. Mantel: Problem 28, Wiskundige Opgaven\n10 (1907), 60\u201361.","journal-title":"Wiskundige Opgaven"},{"key":"3290_CR20","doi-asserted-by":"crossref","first-page":"1980","DOI":"10.1137\/130947878","volume":"28","author":"F. Mousset","year":"2014","unstructured":"F. Mousset, R. Nenadov and A. Steger: On the number of graphs without large cliques, Siam J. Discrete Math.\n28 (2014), 1980\u20131986.","journal-title":"Siam J. Discrete Math."},{"key":"3290_CR21","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s00493-003-0016-1","volume":"23","author":"D. Osthus","year":"2003","unstructured":"D. Osthus, H. J. Pr\u00f6mel and A. Taraz: For which densities are random trianglefree graphs almost surely bipartite?, Combinatorica\n23 (2003), 105\u2013150.","journal-title":"Combinatorica"},{"key":"3290_CR22","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF01305238","volume":"12","author":"H. J. Pr\u00f6mel","year":"1992","unstructured":"H. J. Pr\u00f6mel and A. Steger: The asymptotic number of graphs not containing a fixed color-critical subgraph, Combinatorica\n12 (1992), 463\u2013473.","journal-title":"Combinatorica"},{"key":"3290_CR23","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"F.P. Ramsey","year":"1930","unstructured":"F.P. Ramsey: On a problem of formal logic, Proc. London Math. Soc.\n30 (1930), 264\u2013286.","journal-title":"Proc. London Math. Soc."},{"key":"3290_CR24","first-page":"279","volume-title":"Theory of graphs (Proc. Colloq., Tihany, (1966))","author":"M. Simonovits","year":"1968","unstructured":"M. Simonovits: A method for solving extremal problems in graph theory, stability problems, Theory of graphs (Proc. Colloq., Tihany, (1966)), Academic press, New York, (1968), 279\u2013319."},{"key":"3290_CR25","unstructured":"D. Saxton and A. Thomason: Hypergraph containers, to appear in Invent. Math."},{"key":"3290_CR26","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"P. Tur\u00e1n: Eine Extremalaufgabe aus der Graphentheorie, Mat. Fiz. Lapok\n48 (1941), 436\u2013452.","journal-title":"Mat. Fiz. Lapok"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-015-3290-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3290-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3290-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3290-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:32:52Z","timestamp":1559079172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-015-3290-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,10]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["3290"],"URL":"https:\/\/doi.org\/10.1007\/s00493-015-3290-9","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,10]]}}}