{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T09:22:47Z","timestamp":1772097767011,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":[[1997,6]]},"DOI":"10.1007\/bf01200905","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T15:38:30Z","timestamp":1108741110000},"page":"163-171","source":"Crossref","is-referenced-by-count":12,"title":["Nonexistence of universal graphs without some trees"],"prefix":"10.1007","volume":"17","author":[{"given":"Z.","family":"F\ufffdredi","sequence":"first","affiliation":[]},{"given":"P.","family":"Komj\ufffdth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"B. Bollob\ufffds:Random graphs, 1985, Academic Press."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0012-365X(74)90119-8","volume":"10","author":"P. A. Catlin","year":"1974","unstructured":"P. A. Catlin: Subgraphs of graphs I,Discrete Mathematics,10 (1974), 225?233.","journal-title":"Discrete Mathematics"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/jgt.3190180405","volume":"18","author":"G. Cherlin","year":"1994","unstructured":"G. Cherlin, P. Komj\ufffdth: There is no universal countable pentagon free graph,Journal of Graph Theory,18 (1994), 337?341.","journal-title":"Journal of Graph Theory"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/(SICI)1097-0118(199703)24:3<237::AID-JGT5>3.0.CO;2-Q","volume":"24","author":"G. Cherlin","year":"1997","unstructured":"G. Cherlin, N. Shi: Graphs omitting sums of complete graphs,Journal of Graph Th.,24 (1997), 237?247.","journal-title":"Journal of Graph Th."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1002\/(SICI)1097-0118(199603)21:3<351::AID-JGT11>3.0.CO;2-K","volume":"21","author":"G. Cherlin","year":"1996","unstructured":"G. Cherlin, N. Shi: Graphs omitting a finite set of cycles,Journal of Graph Theory,21 (1996), 351?355.","journal-title":"Journal of Graph Theory"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/(SICI)1097-0118(199705)25:1<53::AID-JGT3>3.0.CO;2-H","volume":"25","author":"Z. F\ufffdredi","year":"1997","unstructured":"Z. F\ufffdredi, P. Komj\ufffdth: On the existence of countable universal graphs,Journal of Graph Th.,25 (1997), 53?58.","journal-title":"Journal of Graph Th."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00052907","volume":"73","author":"M. Goldstern","year":"1996","unstructured":"M. Goldstern, M. Kojman: Universal arrow-free graphs,Acta Math. Hung,73 (1996), 319?326.","journal-title":"Acta Math. Hung"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"A. Hajnal, J. Pach: Monochromatic paths in infinite graphs, in:Finite and Infinite sets, Coll. Math. Soc. J. Bolyai,37, (Eger, Hungary, 1981), 359?369.","DOI":"10.1016\/B978-0-444-86893-0.50028-0"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/BF02787220","volume":"64","author":"P. Komj\ufffdth","year":"1988","unstructured":"P. Komj\ufffdth, A. Mekler, J. Pach: Some universal graphs,Israel Journal of Mathematics,64 (1988), 158?168.","journal-title":"Israel Journal of Mathematics"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1112\/S002557930001250X","volume":"31","author":"P. Komj\ufffdth","year":"1984","unstructured":"P. Komj\ufffdth, J. Pach: Universal graphs without large bipartite graphs,Mathematika,31 (1984), 282?290.","journal-title":"Mathematika"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0012-365X(91)90340-8","volume":"95","author":"P. Komj\ufffdth","year":"1991","unstructured":"P. Komj\ufffdth, J. Pach: Universal elements and the complexity of certain classes of infinite graphs,Discrete Math. 95 (1991), 255?270.","journal-title":"Discrete Math."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01305955","volume":"14","author":"P. Komj\ufffdth","year":"1994","unstructured":"P. Komj\ufffdth, J. Pach: The complexity of a class of infinite graphs,Combinatorica,14 (1994), 121?125.","journal-title":"Combinatorica"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"331","DOI":"10.4064\/aa-9-4-331-340","volume":"9","author":"R. Rado","year":"1964","unstructured":"R. Rado: Universal graphs and universal functions,Acta Arith,9 (1964), 331?340.","journal-title":"Acta Arith"},{"key":"CR14","unstructured":"R. Rado: Universal graphs, inA Seminar in Graph Theory, (eds. Harary, Beineke), Holt, Rinehart, and Winston Co., 1967."},{"key":"CR15","unstructured":"V. R\ufffddl, L. Thoma: The complexity of cover graph recognition for some varieties of finite lattices,to appear."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0095-8956(78)90005-9","volume":"25","author":"N. Sauer","year":"1978","unstructured":"N. Sauer, J. Spencer: Edge disjoint placement of graphs,Journal of Combinatorial Theory (B),25 (1978), 295?302.","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"CR17","unstructured":"G. Cherlin, N. Shi, andL. Talggren: Graphs omitting a bushy tree,Journal of Graph Th., to appear."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200905.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01200905\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200905","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T21:12:51Z","timestamp":1586121171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01200905"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["BF01200905"],"URL":"https:\/\/doi.org\/10.1007\/bf01200905","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}