{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T15:16:21Z","timestamp":1648566981592},"reference-count":16,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"vor","delay-in-days":1466,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1016\/j.disc.2016.01.007","type":"journal-article","created":{"date-parts":[[2016,2,18]],"date-time":"2016-02-18T17:30:14Z","timestamp":1455816614000},"page":"1871-1877","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Counting ordered graphs that avoid certain subgraphs"],"prefix":"10.1016","volume":"339","author":[{"given":"L\u00e1szl\u00f3","family":"Ozsv\u00e1rt","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2016.01.007_br000005","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/j.disc.2016.01.007_br000010","series-title":"Combinatorics of Permutations","author":"B\u00f3na","year":"2012"},{"key":"10.1016\/j.disc.2016.01.007_br000015","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/0012-365X(74)90081-8","article-title":"Enumeration of ladder graphs","volume":"9","author":"Domb","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2016.01.007_br000020","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0012-365X(92)90316-8","article-title":"Davenport\u2013Schinzel theory of matrices","volume":"103","author":"F\u00fcredi","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2016.01.007_br000025","series-title":"M. Graphical Enumeration","author":"Harary","year":"1973"},{"key":"10.1016\/j.disc.2016.01.007_br000030","doi-asserted-by":"crossref","first-page":"#R39","DOI":"10.37236\/763","article-title":"On pattern-avoiding partitions","author":"Jelinek","year":"2008","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.disc.2016.01.007_br000035","series-title":"Formal Power Series and Algebraic Combinatorics","first-page":"250","article-title":"The F\u00fcredi\u2013Hajnal conjecture implies the Stanley\u2013Wilf conjecture","author":"Klazar","year":"2000"},{"key":"10.1016\/j.disc.2016.01.007_br000040","doi-asserted-by":"crossref","DOI":"10.37236\/1512","article-title":"Counting pattern-free set partitions. II. Noncrossing and other hypergraphs","volume":"7","author":"Klazar","year":"2000","journal-title":"Electron. J. Combin."},{"issue":"2","key":"10.1016\/j.disc.2016.01.007_br000045","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.aam.2006.05.002","article-title":"Extensions of the linear bound in the F\u00fcredi-Hajnal conjecture","volume":"38","author":"Klazar","year":"2006","journal-title":"Adv. in Appl. Math."},{"key":"10.1016\/j.disc.2016.01.007_br000050","doi-asserted-by":"crossref","first-page":"#R75","DOI":"10.37236\/799","article-title":"On growth rates of permutations, set partitions, ordered graphs and other objects","author":"Klazar","year":"2008","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.disc.2016.01.007_br000055","doi-asserted-by":"crossref","first-page":"25","DOI":"10.2298\/AADM121130023M","article-title":"Partial matchings and pattern avoidance","volume":"7","author":"Mansour","year":"2013","journal-title":"Appl. Anal. Discrete Math."},{"issue":"1","key":"10.1016\/j.disc.2016.01.007_br000060","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.jcta.2004.04.002","article-title":"Excluded permutation matrices and the Stanley\u2013Wilf conjecture","volume":"107","author":"Marcus","year":"2004","journal-title":"J. Combin. Theory A"},{"issue":"1","key":"10.1016\/j.disc.2016.01.007_br000065","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF02773960","article-title":"Forbidden paths and cycles in ordered graphs and matrices","volume":"155","author":"Pach","year":"2006","journal-title":"Israel J. Math."},{"key":"10.1016\/j.disc.2016.01.007_br000070","unstructured":"N.J.A. Sloane, The Online Encyclopedia of Integer Sequences. http:\/\/oeis.org."},{"key":"10.1016\/j.disc.2016.01.007_br000075","series-title":"Enumerative Combinatorics, Vol. 2","volume":"vol. 62","author":"Stanley","year":"1999"},{"key":"10.1016\/j.disc.2016.01.007_br000080","series-title":"Enumerative Combinatorics, Vol. 1","volume":"vol. 49","author":"Stanley","year":"2012"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X16000170?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X16000170?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T02:48:17Z","timestamp":1594003697000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X16000170"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":16,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["S0012365X16000170"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2016.01.007","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2016,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Counting ordered graphs that avoid certain subgraphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2016.01.007","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}