{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T00:34:31Z","timestamp":1775522071830,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1981,6,1]],"date-time":"1981-06-01T00:00:00Z","timestamp":360201600000},"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":[[1981,6]]},"DOI":"10.1007\/bf02579274","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T22:16:08Z","timestamp":1174601768000},"page":"199-202","source":"Crossref","is-referenced-by-count":28,"title":["Simple proof of the existence of restricted ramsey graphs by means of a partite construction"],"prefix":"10.1007","volume":"1","author":[{"given":"Jaroslav","family":"Ne\u0161et\u0159il","sequence":"first","affiliation":[]},{"given":"Vojt\u011bch","family":"R\u00f6dl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02579274_CR1","unstructured":"W. Deuber, Generalizations of Ramsey\u2019s theorem, in:Infinite and Finite Sets (A. Hajnal et al, eds.),Colloquia Mathematica Societatis J. Bolyai 10, North-Holland (1975), 323\u2013332."},{"key":"BF02579274_CR2","unstructured":"P. Erd\u0151s, A. Hajnal andL. P\u00f3sa, Strong embeddings of graphs into colored graphs, in:Infinite and finite sets (A. Hajnal et al., eds.)Coll. Math. Soc. J. Bolyai 10, North-Holland (1975), 1127\u20131132."},{"key":"BF02579274_CR3","unstructured":"P. Erd\u0151s, Problems and results on finite and infinite graphs, in:Recent advances in graph theory, Academia Praha (1975), 183\u2013192."},{"key":"BF02579274_CR4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/0118004","volume":"18","author":"J. Folkman","year":"1970","unstructured":"J. Folkman, Graphs with monochromatic complete subgraphs in every edge coloring,SIAM J. Appl. Math. 18 (1970), 19\u201329.","journal-title":"SIAM J. Appl. Math."},{"key":"BF02579274_CR5","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0095-8956(76)90015-0","volume":"20","author":"J. Ne\u0161et\u0159il","year":"1976","unstructured":"J. Ne\u0161et\u0159il andV. R\u00f6dl, The Ramsey property for graphs with forbidden complete subgraphs,J. Comb. Theory B 20 (1976), 243\u2013249.","journal-title":"J. Comb. Theory B"},{"key":"BF02579274_CR6","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0095-8956(79)90084-4","volume":"27","author":"J. Ne\u0161et\u0159il","year":"1979","unstructured":"J. Ne\u0161et\u0159il andV. R\u00f6dl, A short constructive proof of the existence of highly chromatic graphs without short cycles,J. Comb. Theory B 27 (1979) 225\u2013227.","journal-title":"J. Comb. Theory B"},{"key":"BF02579274_CR7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0012-365X(78)90186-3","volume":"23","author":"J. Ne\u0161et\u0159il","year":"1978","unstructured":"J. Ne\u0161et\u0159il andV. R\u00f6dl, A simple proof of the Galvin Ramsey property of the class of all finite graphs and a dimension of a graph,Discrete Mathematics 23 (1978), 49\u201355.","journal-title":"Discrete Mathematics"},{"key":"BF02579274_CR8","unstructured":"J. Ne\u0161et\u0159il andV. R\u00f6dl, Partition (Ramsey) theory \u2014 a survey, in:Combinatorics (A. Hajnal and Vera T. S\u00f3s, eds.)Coll. Math. Soc. J. Bolyai 18, North-Holland (1978), 759\u2013792."},{"key":"BF02579274_CR9","doi-asserted-by":"crossref","unstructured":"J. Ne\u0161et\u0159il andV. R\u00f6dl, Partition theory and its application, in:Surveys in Combinatorics, (B. Bollob\u00e1s, ed.)London Math. Soc. Lecture Notes 38, Cambridge Univ. Press 1979, 96\u2013156.","DOI":"10.1017\/CBO9780511662133.006"},{"key":"BF02579274_CR10","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"F. P. Ramsey","year":"1930","unstructured":"F. P. Ramsey, On a problem of formal logic,Proc. London Math. Soc. 30 (1930), 264\u2013286.","journal-title":"Proc. London Math. Soc."},{"key":"BF02579274_CR11","unstructured":"V. R\u00f6dl, A generalization of Ramsey theorem, in:Graphs, Hypergraphs and Block Systems, Zielona Gora (1976), 211\u2013220."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579274.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579274\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579274","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:45:01Z","timestamp":1558197901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,6]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,6]]}},"alternative-id":["BF02579274"],"URL":"https:\/\/doi.org\/10.1007\/bf02579274","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,6]]}}}