{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T05:38:58Z","timestamp":1770701938822,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T00:00:00Z","timestamp":1298937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s00493-011-2610-y","type":"journal-article","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T11:38:56Z","timestamp":1312976336000},"page":"131-150","source":"Crossref","is-referenced-by-count":14,"title":["The number of K m,m -free graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"J\u00f3zsef","family":"Balogh","sequence":"first","affiliation":[]},{"given":"Wojciech","family":"Samotij","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,11]]},"reference":[{"issue":"2","key":"2610_CR1","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.jctb.2010.11.001","volume":"101","author":"J. Balogh","year":"2011","unstructured":"J. Balogh, B. Bollob\u00e1s and M. Simonovits: The fine structure of octahedron-free graphs, Journal of Combinatorial Theory B 101(2) (2011), 67\u201384.","journal-title":"Journal of Combinatorial Theory B"},{"key":"2610_CR2","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, Journal of Combinatorial Theory B 91 (2004), 1\u201324.","journal-title":"Journal of Combinatorial Theory B"},{"key":"2610_CR3","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 ofgraphs without given excluded subgraphs, Random Structures and Algorithms 34 (2009), 305\u2013318.","journal-title":"Random Structures and Algorithms"},{"issue":"3","key":"2610_CR4","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1137\/09074989X","volume":"24","author":"J. Balogh","year":"2010","unstructured":"J. Balogh and W. Samotij: Almost all C 4-free graphs have fewer than (1\u2212\u025b) \u00b7 ex(n,C 4) edges, SIAM Journal on Discrete Mathematics 24(3) (2010), 1011\u20131018.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"2610_CR5","unstructured":"J. Balogh and W. Samotij: The number of K s,t-free graphs, Journal of the London Mathematical Society Advance Access published February 1, 2011, doi:10.1112\/ jlms\/jdq086."},{"key":"2610_CR6","doi-asserted-by":"crossref","unstructured":"J. Bondy: A Collection of Open Problems, in: Combinatorial Mathematics: Proceedings of the Third International Conference, New York Academy of Sciences, 1989, pp. 429\u2013434.","DOI":"10.1111\/j.1749-6632.1989.tb22483.x"},{"key":"2610_CR7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.4153\/CMB-1966-036-2","volume":"9","author":"W. Brown","year":"1966","unstructured":"W. Brown: On graphs that do not contain a Thomsen graph, Canadian Mathematical Bulletin 9 (1966), 281\u2013285.","journal-title":"Canadian Mathematical Bulletin"},{"key":"2610_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/(SICI)1097-0118(199705)25:1<3::AID-JGT1>3.0.CO;2-R","volume":"25","author":"F. Chung","year":"1997","unstructured":"F. Chung: Open problems of Paul Erd\u0151s in graph theory, Journal of Graph Theory 25 (1997), 3\u201336.","journal-title":"Journal of Graph Theory"},{"key":"2610_CR9","unstructured":"D. Conlon and T. Gowers: Combinatorial theorems in sparse random sets, manuscript."},{"key":"2610_CR10","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 and Combinatorics 2 (1986), 113\u2013121.","journal-title":"Graphs and Combinatorics"},{"key":"2610_CR11","unstructured":"P. Erd\u0151s, D. Kleitman and B. Rothschild: Asymptotic enumeration of K n-free graphs, in: Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973), Tomo II, Atti dei Convegni Lincei No. 17, Accad. Naz. Lincei, 1976, pp. 19\u201327."},{"key":"2610_CR12","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1090\/S0002-9904-1946-08715-7","volume":"52","author":"P. Erd\u0151s","year":"1946","unstructured":"P. Erd\u0151s and A. Stone: On the structure of linear graphs, Bulletin of the American Mathematical Society 52 (1946), 1087\u20131091.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"2610_CR13","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/0012-365X(94)90287-9","volume":"126","author":"Z. F\u00fcredi","year":"1994","unstructured":"Z. F\u00fcredi: Random Ramsey graphs for the four-cycle, Discrete Mathematics 126 (1994), 407\u2013410.","journal-title":"Discrete Mathematics"},{"key":"2610_CR14","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1017\/S0963548300001814","volume":"5","author":"Z. F\u00fcredi","year":"1996","unstructured":"Z. F\u00fcredi: An upper bound on Zarankiewicz\u2019 problem, Combinatorics, Probability and Computing 5 (1996), 29\u201333.","journal-title":"Combinatorics, Probability and Computing"},{"key":"2610_CR15","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1006\/jctb.1995.1035","volume":"64","author":"P. Haxell","year":"1995","unstructured":"P. Haxell, Y. Kohayakawa and T. \u0141uczak: Tur\u00e1n\u2019s extremal problem in random graphs: forbidding even cycles; Journal of Combinatorial Theory B 64 (1995), 273\u2013287.","journal-title":"Journal of Combinatorial Theory B"},{"key":"2610_CR16","unstructured":"D. Kleitman and D. Wilson: On the number of graphs which lack small cycles, manuscript, 1996."},{"key":"2610_CR17","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0012-365X(82)90204-7","volume":"41","author":"D. Kleitman","year":"1982","unstructured":"D. Kleitman and K. Winston: On the number of graphs without 4-cycles, Discrete Mathematics 41 (1982), 167\u2013172.","journal-title":"Discrete Mathematics"},{"issue":"1","key":"2610_CR18","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/PL00009804","volume":"18","author":"Y. Kohayakawa","year":"1998","unstructured":"Y. Kohayakawa, B. Kreuter and A. Steger: An extremal problem for random graphs and the number of graphs with large even-girth, Combinatorica 18(1) (1998), 101\u2013120.","journal-title":"Combinatorica"},{"key":"2610_CR19","first-page":"637","volume":"303","author":"P. Kolaitis","year":"1987","unstructured":"P. Kolaitis, H. Pr\u00f6mel and B. Rothschild: K l+1-free graphs: asymptotic structure and a 0\u20131 law; Transactions of the American Mathematical Society 303 (1987), 637\u2013671.","journal-title":"Transactions of the American Mathematical Society"},{"key":"2610_CR20","doi-asserted-by":"crossref","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","volume":"3","author":"T. K\u0151v\u00e1ri","year":"1954","unstructured":"T. K\u0151v\u00e1ri, V. T. S\u00f3s and P. Tur\u00e1n: On a problem of K. Zarankiewicz, Colloquium Mathematicum 3 (1954), 50\u201357.","journal-title":"Colloquium Mathematicum"},{"key":"2610_CR21","doi-asserted-by":"crossref","unstructured":"M. Mitzenmacher and E. Upfal: Probability and Computing: Randomized Algorithms and Probabilistic Analysis; Cambridge University Press, 2005.","DOI":"10.1017\/CBO9780511813603"},{"key":"2610_CR22","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0012-365X(00)00211-9","volume":"229","author":"H. Pr\u00f6mel","year":"2001","unstructured":"H. Pr\u00f6mel, A. Steger and A. Taraz: Asymptotic enumeration, global structure, and constrained evolution; Discrete Mathematics 229 (2001), 213\u2013233.","journal-title":"Discrete Mathematics"},{"key":"2610_CR23","unstructured":"M. Schacht: Extremal results for random discrete structures, manuscript."},{"key":"2610_CR24","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"P. Tur\u00e1n: Eine Extremalaufgabe aus der Graphentheorie, Mat. Fiz. Lapok 48 (1941), 436\u2013452.","journal-title":"Mat. Fiz. Lapok"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-011-2610-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-011-2610-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-011-2610-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T23:41:40Z","timestamp":1560469300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-011-2610-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["2610"],"URL":"https:\/\/doi.org\/10.1007\/s00493-011-2610-y","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}