{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T16:26:42Z","timestamp":1776702402238,"version":"3.51.2"},"reference-count":10,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5252,"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":[[1999,3]]},"DOI":"10.1016\/s0012-365x(98)00339-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:14:12Z","timestamp":1027602852000},"page":"259-265","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":16,"title":["Some remarks on universal graphs"],"prefix":"10.1016","volume":"199","author":[{"given":"P.","family":"Komj\u00e1th","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00339-2_BIB1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/jgt.3190180405","article-title":"There is no universal countable pentagon free graph","volume":"18","author":"Cherlin","year":"1994","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00339-2_BIB2","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1002\/(SICI)1097-0118(199603)21:3<351::AID-JGT11>3.0.CO;2-K","article-title":"Graphs omitting a finite set of cycles","volume":"21","author":"Cherlin","year":"1996","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00339-2_BIB3","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1002\/(SICI)1097-0118(199712)26:4<203::AID-JGT4>3.0.CO;2-U","article-title":"Graphs omitting a bushy tree","volume":"26","author":"Cherlin","year":"1997","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00339-2_BIB4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/(SICI)1097-0118(199705)25:1<53::AID-JGT3>3.0.CO;2-H","article-title":"On the existence of countable universal graphs","volume":"25","author":"F\u00fcredi","year":"1997","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00339-2_BIB5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01200905","article-title":"Nonexistence of universal graphs without some trees","volume":"17","author":"F\u00fcredi","year":"1997","journal-title":"Combinatorica"},{"key":"10.1016\/S0012-365X(98)00339-2_BIB6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00052907","article-title":"Universal arrow free graphs","volume":"73","author":"Goldstern","year":"1996","journal-title":"Acta Math. Hungar."},{"key":"10.1016\/S0012-365X(98)00339-2_BIB7","series-title":"Finite and Infinite sets","first-page":"359","article-title":"Monochromatic paths in infinite graphs","volume":"vol. 37","author":"Hajnal","year":"1981"},{"key":"10.1016\/S0012-365X(98)00339-2_BIB8","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/BF02787220","article-title":"Some universal graphs","volume":"64","author":"Komj\u00e1th","year":"1988","journal-title":"Israel J. Math."},{"key":"10.1016\/S0012-365X(98)00339-2_BIB9","doi-asserted-by":"crossref","first-page":"331","DOI":"10.4064\/aa-9-4-331-340","article-title":"Universal graphs and universal functions","volume":"9","author":"Rado","year":"1964","journal-title":"Acta Arith."},{"key":"10.1016\/S0012-365X(98)00339-2_BIB10","series-title":"A Seminar in Graph Theory","article-title":"Universal graphs","author":"Rado","year":"1967"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98003392?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98003392?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T06:03:11Z","timestamp":1757916191000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98003392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":10,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["S0012365X98003392"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00339-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Some remarks on universal graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0012-365X(98)00339-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}