{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:30:22Z","timestamp":1649017822894},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,2,1]],"date-time":"2008-02-01T00:00:00Z","timestamp":1201824000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1007\/s00373-007-0769-1","type":"journal-article","created":{"date-parts":[[2008,2,14]],"date-time":"2008-02-14T01:24:51Z","timestamp":1202952291000},"page":"59-65","source":"Crossref","is-referenced-by-count":1,"title":["Almost Given Length Cycles in Digraphs"],"prefix":"10.1007","volume":"24","author":[{"given":"Raphael","family":"Yuster","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"769_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Duke, R.A., Lefmann, H., R\u00f6dl, V., Yuster, R.: The algorithmic aspects of the Regularity Lemma. J. Algorithms 16, 80\u2013109 (1994)","DOI":"10.1006\/jagm.1994.1005"},{"key":"769_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Shapira, A.: Testing subgraphs in directed graphs. Proc. 35th ACM STOC, ACM Press 700\u2013709 (2003)","DOI":"10.1145\/780642.780644"},{"key":"769_CR3","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. Springer (1998)","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"769_CR4","unstructured":"Czygrinow, A., Poljak, S., R\u00f6dl, V.: Constructive Quasi-Ramsey numbers and tournament ranking. SIAM J. Disc. Math. 12, 48\u201363 (1999)"},{"key":"769_CR5","doi-asserted-by":"crossref","unstructured":"de la Vega, W.F.: On the maximal cardinality of a consistent set of arcs in a random tournament. J. Combin. Theory, Ser. B 35, 328f\u0301b-332 (1983)","DOI":"10.1016\/0095-8956(83)90060-6"},{"key":"769_CR6","unstructured":"Koml\u00f3s, J., Simonovits, M.: Szemer\u00e9di regularity lemma and its application in Graph Theory. Paul Erd\u0151s is 80, Proc. Coll. Bolyai Math. Soc. Vol 2 (Bolyai Math. Soc., Keszthely) 295\u2013352 (1993)"},{"key":"769_CR7","unstructured":"Szemer\u00e9di, E.: Regular partitions of graphs. Proc. Colloque Inter. CNRS 260. (CNRS, Paris) 399\u2013401 (1978)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0769-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-007-0769-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0769-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:28Z","timestamp":1559041108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-007-0769-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["769"],"URL":"https:\/\/doi.org\/10.1007\/s00373-007-0769-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2]]}}}