{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T10:37:14Z","timestamp":1761129434127,"version":"3.40.5"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1016\/j.ejc.2017.05.008","type":"journal-article","created":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T06:32:35Z","timestamp":1497940355000},"page":"143-153","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["The structure and the number of<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" altimg=\"si1.gif\" display=\"inline\" id=\"mml1\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P<\/mml:mi><\/mml:mrow><mml:mrow><mml:mn>7<\/mml:mn><\/mml:mrow><\/mml:msub><\/mml:math>-free bipartite graphs"],"prefix":"10.1016","volume":"65","author":[{"given":"Vadim","family":"Lozin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5755-4141","authenticated-orcid":false,"given":"Viktor","family":"Zamaraev","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.ejc.2017.05.008_b1","first-page":"3","article-title":"On lower layers of a lattice of hereditary classes of graphs","volume":"4","author":"Alekseev","year":"1997","journal-title":"Diskretn. Anal. Issled. Oper. Ser. 1"},{"issue":"2","key":"10.1016\/j.ejc.2017.05.008_b2","first-page":"148","article-title":"Range of values of entropy of hereditary classes of graphs","volume":"4","author":"Alekseev","year":"1992","journal-title":"Diskret. Mat."},{"issue":"3","key":"10.1016\/j.ejc.2017.05.008_b3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1002\/jgt.20355","article-title":"Forbidden induced bipartite graphs","volume":"60","author":"Allen","year":"2009","journal-title":"J. Graph Theory"},{"issue":"1","key":"10.1016\/j.ejc.2017.05.008_b4","doi-asserted-by":"crossref","DOI":"10.37236\/124","article-title":"Clique-width and the speed of hereditary properties","volume":"16","author":"Allen","year":"2009","journal-title":"Electron. J Combin."},{"issue":"2","key":"10.1016\/j.ejc.2017.05.008_b5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.jctb.2010.10.001","article-title":"The structure of almost all graphs in a hereditary property","volume":"101","author":"Alon","year":"2011","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"10.1016\/j.ejc.2017.05.008_b6","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1006\/jctb.2000.1952","article-title":"The speed of hereditary properties of graphs","volume":"79","author":"Balogh","year":"2000","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"10.1016\/j.ejc.2017.05.008_b7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.jctb.2005.02.004","article-title":"A jump to the Bell number for hereditary graph properties","volume":"95","author":"Balogh","year":"2005","journal-title":"J. Combin. Theory Ser. B"},{"issue":"5","key":"10.1016\/j.ejc.2017.05.008_b8","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1112\/blms\/27.5.417","article-title":"Projections of bodies and hereditary properties of hypergraphs","volume":"27","author":"Bollob\u00e1s","year":"1995","journal-title":"Bull. Lond. Math. Soc."},{"key":"10.1016\/j.ejc.2017.05.008_b9","series-title":"The Mathematics of Paul Erd\u0151s, II","first-page":"70","article-title":"Hereditary and monotone properties of graphs","volume":"vol. 14","author":"Bollob\u00e1s","year":"1997"},{"issue":"2","key":"10.1016\/j.ejc.2017.05.008_b10","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01788085","article-title":"The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent","volume":"2","author":"Erd\u0151s","year":"1986","journal-title":"Graphs Combin."},{"key":"10.1016\/j.ejc.2017.05.008_b11","series-title":"Colloquio Internazionale Sulle Teorie Combinatorie (Rome, 1973), Tomo II","first-page":"19","article-title":"Asymptotic enumeration of Kn-free graphs","volume":"vol. 17","author":"Erd\u0151s","year":"1976"},{"issue":"4","key":"10.1016\/j.ejc.2017.05.008_b12","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1142\/S0129054199000368","article-title":"Bipartite graphs totally decomposable by canonical decomposition","volume":"10","author":"Fouquet","year":"1999","journal-title":"Internat. J. Found. Comput. Sci."},{"issue":"1","key":"10.1016\/j.ejc.2017.05.008_b13","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0012-365X(78)90178-4","article-title":"Trivially perfect graphs","volume":"24","author":"Golumbic","year":"1978","journal-title":"Discrete Math."},{"issue":"3\u20134","key":"10.1016\/j.ejc.2017.05.008_b14","first-page":"413","article-title":"Problems from the world surrounding perfect graphs","volume":"19","author":"Gy\u00e1rf\u00e1s","year":"1987","journal-title":"Appl. Math."},{"issue":"2","key":"10.1016\/j.ejc.2017.05.008_b15","first-page":"637","article-title":"Kl+1-free graphs: asymptotic structure and a 0 -1 law","volume":"303","author":"Kolaitis","year":"1987","journal-title":"Trans. Amer. Math. Soc."},{"issue":"1","key":"10.1016\/j.ejc.2017.05.008_b16","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1090\/S0273-0979-1995-00569-0","article-title":"A new series of dense graphs of high girth","volume":"32","author":"Lazebnik","year":"1995","journal-title":"Bull. Amer. Math. Soc."},{"issue":"1","key":"10.1016\/j.ejc.2017.05.008_b17","doi-asserted-by":"crossref","DOI":"10.37236\/644","article-title":"A note on the speed of hereditary graph properties","volume":"18","author":"Lozin","year":"2011","journal-title":"Electron. J Combin."},{"issue":"4","key":"10.1016\/j.ejc.2017.05.008_b18","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1016\/j.ejc.2011.10.006","article-title":"Locally bounded coverings and factorial properties of graphs","volume":"33","author":"Lozin","year":"2012","journal-title":"European J. Combin."},{"issue":"3","key":"10.1016\/j.ejc.2017.05.008_b19","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/jgt.21799","article-title":"Boundary properties of factorial classes of graphs","volume":"78","author":"Lozin","year":"2015","journal-title":"J. Graph Theory"},{"issue":"5","key":"10.1016\/j.ejc.2017.05.008_b20","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1016\/j.jctb.2006.01.006","article-title":"Proper minor-closed families are small","volume":"96","author":"Norine","year":"2006","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"10.1016\/j.ejc.2017.05.008_b21","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/rsa.3240020106","article-title":"Angelika excluding induced subgraphs: quadrilaterals","volume":"2","author":"Pr\u00f6mel","year":"1991","journal-title":"Random Structures Algorithms"},{"issue":"1","key":"10.1016\/j.ejc.2017.05.008_b22","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/rsa.3240030104","article-title":"Excluding induced subgraphs. III. A general asymptotic","volume":"3","author":"Pr\u00f6mel","year":"1992","journal-title":"Random Structures Algorithms"},{"issue":"1\u20133","key":"10.1016\/j.ejc.2017.05.008_b23","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0166-218X(93)90237-I","article-title":"Excluding induced subgraphs. II. Extremal graphs.","volume":"44","author":"Pr\u00f6mel","year":"1993","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.ejc.2017.05.008_b24","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1006\/jctb.1994.1027","article-title":"On the size of hereditary classes of graphs","volume":"61","author":"Scheinerman","year":"1994","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"10.1016\/j.ejc.2017.05.008_b25","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0166-218X(96)00094-7","article-title":"Quasi-threshold graphs","volume":"69","author":"Yan","year":"1996","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.ejc.2017.05.008_b26","first-page":"277","article-title":"Almost all factorial subclasses of quasi-line graphs with respect to one forbidden subgraph","volume":"1","author":"Zamaraev","year":"2011","journal-title":"Moscow J. Combin. Number Theory"},{"issue":"6","key":"10.1016\/j.ejc.2017.05.008_b27","first-page":"30","article-title":"On factorial subclasses of claw-free graphs","volume":"20","author":"Zamaraev","year":"2013","journal-title":"Diskretnyi Analiz I Issledovanie Operatsii"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669817300665?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669817300665?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,10,10]],"date-time":"2020-10-10T12:23:50Z","timestamp":1602332630000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669817300665"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":27,"alternative-id":["S0195669817300665"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2017.05.008","relation":{},"ISSN":["0195-6698"],"issn-type":[{"type":"print","value":"0195-6698"}],"subject":[],"published":{"date-parts":[[2017,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The structure and the number of -free bipartite graphs","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2017.05.008","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}