{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:23:37Z","timestamp":1759335817785},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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,1]]},"DOI":"10.1007\/s00493-011-2630-7","type":"journal-article","created":{"date-parts":[[2011,8,8]],"date-time":"2011-08-08T09:43:45Z","timestamp":1312796625000},"page":"85-93","source":"Crossref","is-referenced-by-count":7,"title":["The structure of hereditary properties and 2-coloured multigraphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Edward","family":"Marchant","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Thomason","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,9]]},"reference":[{"key":"2630_CR1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1515\/dma.1993.3.2.191","volume":"3","author":"V. E. Alekseev","year":"1993","unstructured":"V. E. Alekseev: On the entropy values of hereditary classes of graphs, Discrete Math. Appl. 3 (1993), 191\u2013199.","journal-title":"Discrete Math. Appl"},{"key":"2630_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/rsa.20209","volume":"33","author":"N. Alon","year":"2008","unstructured":"N. Alon and U. Stav: What is the furthest graph from a hereditary property?, Random Structures and Algorithms 33 (2008), 87\u2013104.","journal-title":"Random Structures and Algorithms"},{"key":"2630_CR3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1002\/jgt.20296","volume":"58","author":"M. Axenovich","year":"2008","unstructured":"M. Axenovich, A. K\u00e9zdy and R. Martin: On the editing distance of graphs, J. Graph Theory 58 (2008), 123\u2013138.","journal-title":"J. Graph Theory"},{"key":"2630_CR4","doi-asserted-by":"crossref","unstructured":"J. Balogh and R. Martin: Edit distance and its computation, Electronic Journal of Combinatorics 15 (2008), #R20.","DOI":"10.37236\/744"},{"key":"2630_CR5","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, J. London Math. Soc. 27 (1995), 417\u2013424.","journal-title":"J. London Math. Soc"},{"key":"2630_CR6","unstructured":"B. Bollob\u00e1s and A. Thomason: Hereditary and monotone properties of graphs, in: The Mathematics of Paul Erd\u0151s II (R. L. Graham and J. Ne\u0161et\u0159il, eds.), Algorithms and Combinatorics 14, Springer-Verlag, (1997), 70\u201378."},{"issue":"2","key":"2630_CR7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s004930070019","volume":"20","author":"B. Bollob\u00e1s","year":"2000","unstructured":"B. Bollob\u00e1s and A. Thomason: The structure of hereditary properties and colourings of random graphs, Combinatorica 20(2) (2000), 173\u2013202.","journal-title":"Combinatorica"},{"key":"2630_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0095-8956(73)90034-8","volume":"15","author":"W. G. Brown","year":"1973","unstructured":"W. G. Brown, P. Erd\u0151s and M. Simonovits: Extremal problems for directed graphs, J. Combinatorial Theory (Ser. B) 15 (1973), 77\u201393.","journal-title":"J. Combinatorial Theory (Ser. B)"},{"key":"2630_CR9","series-title":"Colloq. Math. Soc. J\u00e1nos Bolyai","first-page":"119","volume-title":"Finite and Infinite Sets, Eger (Hungary)","author":"W. G. Brown","year":"1981","unstructured":"W. G. Brown, P. Erd\u0151s and M. Simonovits: Inverse extremal digraph problems, in: Finite and Infinite Sets, Eger (Hungary), 1981, Colloq. Math. Soc. J\u00e1nos Bolyai 37, Akad. Kiad\u00f3, Budapest (1985), 119\u2013156."},{"key":"2630_CR10","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1090\/S0002-9947-1985-0808730-0","volume":"292","author":"W. G. Brown","year":"1985","unstructured":"W. G. Brown, P. Erd\u0151s and M. Simonovits: Algorithmic solution of extremal digraph problems, Trans. Amer. Math. Soc. 292 (1985), 421\u2013449.","journal-title":"Trans. Amer. Math. Soc"},{"key":"2630_CR11","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-642-13580-4_10","volume":"20","author":"E. Marchant","year":"2010","unstructured":"E. Marchant and A. Thomason: Extremal graphs and multigraphs with two weighted colours, in: Fete of Combinatorics and Computer Science, Bolyai Soc. Math. Stud. 20, (2010), 239\u2013286.","journal-title":"Fete of Combinatorics and Computer Science, Bolyai Soc. Math. Stud"},{"key":"2630_CR12","series-title":"Contemporary Mathematics","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1090\/conm\/147\/01172","volume-title":"Graph Structure Theory","author":"H. J. Pr\u00f6mel","year":"1993","unstructured":"H. J. Pr\u00f6mel and A. Steger: The asymptotic structure of H-free graphs, in: Graph Structure Theory (N. Robertson and P. Seymour, eds), Contemporary Mathematics 147, Amer. Math. Soc., Providence, 1993, pp. 167\u2013178."},{"key":"2630_CR13","unstructured":"D. C. Richer: Ph.D. thesis, University of Cambridge (2000)."},{"key":"2630_CR14","unstructured":"U. Stav: personal communication."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-011-2630-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-011-2630-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-011-2630-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T03:57:08Z","timestamp":1592798228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-011-2630-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["2630"],"URL":"https:\/\/doi.org\/10.1007\/s00493-011-2630-7","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1]]}}}