{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T03:42:43Z","timestamp":1777434163253,"version":"3.51.4"},"reference-count":6,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,6]],"date-time":"2006-10-06T00:00:00Z","timestamp":1160092800000},"content-version":"vor","delay-in-days":4480,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1994,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>No countable <jats:italic>C<\/jats:italic><jats:sub><jats:italic>n<\/jats:italic><\/jats:sub>\u2010free graph contains every countable <jats:italic>C<\/jats:italic><jats:sub><jats:italic>n<\/jats:italic><\/jats:sub>\u2010free graph as a subgraph, for <jats:italic>n<\/jats:italic> \u2267 4. For <jats:italic>n<\/jats:italic> = 4, this was proved earlier by J. Pach.<\/jats:p>","DOI":"10.1002\/jgt.3190180405","type":"journal-article","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T18:21:07Z","timestamp":1181240467000},"page":"337-341","source":"Crossref","is-referenced-by-count":10,"title":["There is no universal countable pentagon\u2010free graph"],"prefix":"10.1002","volume":"18","author":[{"given":"G.","family":"Cherlin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Komj\u00e1th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,6]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-2.1.69"},{"key":"e_1_2_1_3_2","first-page":"359","volume-title":"Monochromatic paths in infinite graphs. Colloquia Mathematica Societatis Janos Bolyai","author":"Hajnal A.","year":"1981"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02787220"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1112\/S002557930001250X"},{"key":"e_1_2_1_6_2","unstructured":"P.Komj\u00e1thandJ.Pach Universal elements and the complexity of certain classes of infinite graphs. To appear."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.4064\/aa-9-4-331-340"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190180405","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190180405","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T16:22:04Z","timestamp":1698164524000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190180405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["10.1002\/jgt.3190180405"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190180405","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}