{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T15:36:46Z","timestamp":1732030606976},"reference-count":30,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"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":4399,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0304-3975(00)00232-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:59:17Z","timestamp":1027580357000},"page":"75-85","source":"Crossref","is-referenced-by-count":2,"title":["Ramsey numbers for tournaments"],"prefix":"10.1016","volume":"263","author":[{"given":"Yannis","family":"Manoussakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00232-2_BIB1","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0012-365X(81)90068-6","article-title":"Realization of certain generalized paths in tournaments","volume":"34","author":"Alspach","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(00)00232-2_BIB2","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0012-365X(74)90077-6","article-title":"Some Ramsey numbers for directed graphs","volume":"9","author":"Bermond","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(00)00232-2_BIB3","first-page":"119","article-title":"Some Ramsey numbers for tournaments","volume":"47","author":"Bialostocki","year":"1985","journal-title":"Congr. Numer."},{"key":"10.1016\/S0304-3975(00)00232-2_BIB4","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF00354892","article-title":"Decompositions of partially ordered sets into chains and antichains","volume":"5","author":"Caro","year":"1988","journal-title":"Order"},{"key":"10.1016\/S0304-3975(00)00232-2_BIB5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0095-8956(72)90009-3","article-title":"Monochromatic paths in edge-colored graphs","volume":"13","author":"Chv\u00e1tal","year":"1972","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(00)00232-2_BIB6","doi-asserted-by":"crossref","first-page":"351","DOI":"10.4153\/CMB-1964-032-2","article-title":"A problem on tournaments","volume":"7","author":"Erd\u0151s","year":"1964","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/S0304-3975(00)00232-2_BIB7","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1090\/S0002-9904-1946-08715-7","article-title":"On the structure of linear graphs","volume":"52","author":"Erd\u0151s","year":"1946","journal-title":"Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(00)00232-2_BIB8","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1006\/eujc.1996.0045","article-title":"Ramsey-remainder","volume":"17","author":"Erd\u0151s","year":"1996","journal-title":"European J. Combin."},{"key":"10.1016\/S0304-3975(00)00232-2_BIB9","doi-asserted-by":"crossref","first-page":"pp 115, 118","DOI":"10.1016\/0012-365X(73)90041-1","article-title":"Parity of paths and circuits in tournaments","volume":"6","author":"Forcade","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(00)00232-2_BIB10","unstructured":"T. Gallai, On directed paths and circuits, in: P. Erd\u0151s, G.O.H. Katona (Eds.), Theory of Graphs, Academic Press, San Diego, 1968,, pp. 115\u2013118."},{"key":"10.1016\/S0304-3975(00)00232-2_BIB11","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0095-8956(71)90035-9","article-title":"Antidirected Hamiltonian paths in tournaments","volume":"11","author":"Gr\u00fcnbaum","year":"1971","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(00)00232-2_BIB12","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BF02018597","article-title":"A Ramsey-type problem in directed and bipartite graphs","volume":"3","author":"Gy\u00e1fr\u00e1s","year":"1973","journal-title":"Periodica Math. Hungar."},{"key":"10.1016\/S0304-3975(00)00232-2_BIB13","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01206356","article-title":"Trees in tournaments","volume":"11","author":"H\u00e4ggkwist","year":"1991","journal-title":"Combinatorica"},{"key":"10.1016\/S0304-3975(00)00232-2_BIB14","doi-asserted-by":"crossref","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","article-title":"On a problem of K. Zarankiewicz","volume":"3","author":"K\u0151v\u00e1ri","year":"1954","journal-title":"Colloq. Math."},{"key":"10.1016\/S0304-3975(00)00232-2_BIB15","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02579345","article-title":"Largest digraphs contained in all n-tournaments","volume":"3","author":"Linial","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/S0304-3975(00)00232-2_BIB16","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF00582740","article-title":"Decomposition of large uniform hypergraphs","volume":"1","author":"Lonc","year":"1985","journal-title":"Order"},{"key":"10.1016\/S0304-3975(00)00232-2_BIB17","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0021-9800(70)80061-8","article-title":"Disproof of a conjecture of Erd\u0151s and Moser on tournaments","volume":"9","author":"Parker","year":"1970","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0304-3975(00)00232-2_BIB18","first-page":"39","article-title":"Ein kombinatorischer Satz","volume":"7","author":"R\u00e9dei","year":"1934","journal-title":"Acta Sci. Math. (Szeged)"},{"key":"10.1016\/S0304-3975(00)00232-2_BIB19","first-page":"377","article-title":"Embedding oriented n-trees in tournaments","volume":"18","author":"Reid","year":"1983","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/S0304-3975(00)00232-2_BIB20","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0095-8956(72)90035-4","article-title":"Antidirected Hamiltonian paths in tournaments","volume":"12","author":"Rosenfeld","year":"1972","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(00)00232-2_BIB21","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/0095-8956(74)90069-0","article-title":"Antidirected Hamiltonian circuits in tournaments","volume":"16","author":"Rosenfeld","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(00)00232-2_BIB22","first-page":"127","article-title":"Nombre chromatique et plus longs chemins d'un graphe","volume":"1","author":"Roy","year":"1967","journal-title":"Rev. AFIRO"},{"key":"10.1016\/S0304-3975(00)00232-2_BIB23","series-title":"Finite and Infinite Sets, Colloq. Math. Soc. J. Bolyai, Eger, Hungary, 1981","first-page":"663","article-title":"On unavoidable subgraphs of tournaments","author":"Saks","year":"1984"},{"key":"10.1016\/S0304-3975(00)00232-2_BIB24","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1090\/S0002-9947-1986-0837805-6","article-title":"Paths and cycles in tournaments","volume":"296","author":"Thomason","year":"1986","journal-title":"Math. Soc."},{"key":"10.1016\/S0304-3975(00)00232-2_BIB25","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01427945","article-title":"Antidirected Hamiltonian circuits and paths in tournaments","volume":"201","author":"Thomassen","year":"1973","journal-title":"Math. Ann."},{"key":"10.1016\/S0304-3975(00)00232-2_BIB26","first-page":"436","article-title":"On an extremal problem in graph theory","volume":"48","author":"Tur\u00e1n","year":"1941","journal-title":"Math. Fiz. Lapok"},{"key":"10.1016\/S0304-3975(00)00232-2_BIB27","first-page":"141","article-title":"Intersection properties and extremal problems for set systems","volume":"Vol. 8","author":"Tuza","year":"1989"},{"key":"10.1016\/S0304-3975(00)00232-2_BIB28","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0095-8956(92)90042-V","article-title":"Graph coloring in linear time","volume":"55","author":"Tuza","year":"1992","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(00)00232-2_BIB29","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01206360","article-title":"On claws belonging to every tournament","volume":"11","author":"Lu","year":"1991","journal-title":"Combinatorica"},{"key":"10.1016\/S0304-3975(00)00232-2_BIB30","first-page":"67","article-title":"Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament","volume":"1120","author":"Bampis","year":"1998","journal-title":"LNCS"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002322?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002322?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T23:48:00Z","timestamp":1578440880000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002322"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0304397500002322"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00232-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}