{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T04:59:43Z","timestamp":1710997183408},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,4,1]],"date-time":"1989-04-01T00:00:00Z","timestamp":607392000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8873,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1989,4]]},"DOI":"10.1016\/0095-8956(89)90039-7","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T09:37:08Z","timestamp":1107941828000},"page":"133-141","source":"Crossref","is-referenced-by-count":27,"title":["Chromatically optimal rigid graphs"],"prefix":"10.1016","volume":"46","author":[{"given":"Jaroslav","family":"Ne\u0161et\u0159il","sequence":"first","affiliation":[]},{"given":"Vojt\u011bch","family":"R\u00f6dl","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(89)90039-7_BIB1","series-title":"Coll. Math. Soc. Janos Bolyai, 18, Combinatorics","first-page":"53","article-title":"High chromatic rigid graphs, I","author":"Babai","year":"1978"},{"key":"10.1016\/0095-8956(89)90039-7_BIB2","first-page":"55","article-title":"High chromatic rigid graphs, II","volume":"15","author":"Babai","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0095-8956(89)90039-7_BIB3","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(71)90038-4","article-title":"Every finite graph is a full subgraph of a rigid graph","volume":"11","author":"Chv\u00e1tal","year":"1971","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(89)90039-7_BIB4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02020444","article-title":"On chromatic number of graphs and set systems","volume":"17","author":"Erd\u00f6s","year":"1966","journal-title":"Acta Math. Hungar."},{"key":"10.1016\/0095-8956(89)90039-7_BIB5","series-title":"Infinite and Finite Sets","first-page":"425","article-title":"On systems having large chromatic number and not containing prescribed subsystem","author":"Erd\u00f6s","year":"1975"},{"key":"10.1016\/0095-8956(89)90039-7_BIB6","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/BF01297617","article-title":"Symmetric relations (undirected graphs) with given semigroup","volume":"69","author":"Hedrl\u00edn","year":"1965","journal-title":"Monatsh. Math."},{"key":"10.1016\/0095-8956(89)90039-7_BIB7","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1112\/S002557930001250X","article-title":"Universal graphs without large bipartite subgraphs","volume":"31","author":"Komjath","year":"1984","journal-title":"Mathematika"},{"key":"10.1016\/0095-8956(89)90039-7_BIB8","first-page":"283","article-title":"On a technique for representing semigroups as endomorphism semigroups of graphs with given properties","volume":"4","author":"Mendelsohn","year":"1972"},{"key":"10.1016\/0095-8956(89)90039-7_BIB9","first-page":"253","article-title":"Infinite precise objects","volume":"28","author":"Ne\u0161et\u0159il","year":"1978","journal-title":"Math. Slovaca"},{"key":"10.1016\/0095-8956(89)90039-7_BIB10","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1111\/j.1749-6632.1979.tb32819.x","article-title":"Amalgamation of graphs and its applications","volume":"319","author":"Ne\u0161et\u0159il","year":"1979","journal-title":"Ann. New York Acad. Sci."},{"key":"10.1016\/0095-8956(89)90039-7_BIB11","author":"Putlr","year":"1980"},{"key":"10.1016\/0095-8956(89)90039-7_BIB12","first-page":"149","article-title":"A Rigid relation exists on every set","volume":"2","author":"Vop\u011bnka","year":"1965","journal-title":"Comm. Math. Univ. Carol."},{"key":"10.1016\/0095-8956(89)90039-7_BIB13","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."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895689900397?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895689900397?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T10:53:20Z","timestamp":1548759200000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895689900397"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,4]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,4]]}},"alternative-id":["0095895689900397"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(89)90039-7","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1989,4]]}}}