{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T09:02:45Z","timestamp":1724922165933},"reference-count":23,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T00:00:00Z","timestamp":1161907200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2007,5]]},"abstract":"Abstract<\/jats:title>It is easily shown that every digraph with m<\/jats:italic> edges has a directed cut of size at least m<\/jats:italic>\/4, and that 1\/4 cannot be replaced by any larger constant. We investigate the size of the largest directed cut in acyclic<\/jats:italic> digraphs, and prove a number of related results concerning cuts in digraphs and acyclic digraphs. \u00a9 2006 Wiley Periodicals, Inc. J Graph Theory 55: 1\u201313, 2007<\/jats:p>","DOI":"10.1002\/jgt.20215","type":"journal-article","created":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T17:49:17Z","timestamp":1161971357000},"page":"1-13","source":"Crossref","is-referenced-by-count":22,"title":["Maximum directed cuts in acyclic digraphs"],"prefix":"10.1002","volume":"55","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[]},{"given":"B\u00e9la","family":"Bollob\u00e1s","sequence":"additional","affiliation":[]},{"given":"Andr\u00e1s","family":"Gy\u00e1rf\u00e1s","sequence":"additional","affiliation":[]},{"given":"Jen\u0151","family":"Lehel","sequence":"additional","affiliation":[]},{"given":"Alex","family":"Scott","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,27]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01956320"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01261315"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(03)00036-4"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(97)00041-1"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548305007017"},{"key":"e_1_2_1_7_2","first-page":"259","article-title":"Extremal k\u2010colorable subgraphs","volume":"16","author":"Andersen L. D.","year":"1983","journal-title":"Ars Combinatoria"},{"key":"e_1_2_1_8_2","first-page":"xxii + 754","volume-title":"Digraphs: theory, algorithms and applications, Springer monographs in mathematics","author":"Bang\u2010Jensen J.","year":"2001"},{"key":"e_1_2_1_9_2","unstructured":"B.Bollob\u00e1sandA. D.Scott Better bounds for Max Cut in Contemporary Comb Bolyai Soc Math Stud 10 J\u00e1nos Bolyai Math Soc Budapest 2002 pp.185\u2013246."},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.09.020"},{"key":"e_1_2_1_11_2","unstructured":"M.Cropper M.Jacobson A.Gy\u00e1rf\u00e1s andJ.Lehel The Hall\u2010ratio of graphs and hypergraphs Les cahiers du laboratoire Leibniz No 17 Dec.2000pp.1\u201315."},{"key":"e_1_2_1_12_2","first-page":"183","article-title":"The Hall condition number of a graph","volume":"37","author":"Johnson P. D.","year":"1994","journal-title":"Ars Combinatoria"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1973-048-x"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02020444"},{"key":"e_1_2_1_15_2","first-page":"353","article-title":"How to orient the edges of a graph? in Combinatorics","volume":"18","author":"Frank A.","year":"1976","journal-title":"Coll Math Soc J Bolyai"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(80)90071-4"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(82)90040-1"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190060206"},{"key":"e_1_2_1_19_2","volume-title":"Combinatorial problems and exercises","author":"Lov\u00e1sz L.","year":"1993"},{"key":"e_1_2_1_20_2","first-page":"241","volume-title":"Annotated bibliographies in combinatorial optimization","author":"Laurent M.","year":"1997"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(86)90192-5"},{"key":"e_1_2_1_22_2","volume-title":"Combinatorial optimization","author":"Poljak S."},{"key":"e_1_2_1_22_3","first-page":"181","article-title":"DIMACS series in Discrete Math and Theoretical Computer Science","volume":"20","year":"1995","journal-title":"Am Math Soc, Providence, RI"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1938-1501951-4"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.20215","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.20215","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T18:56:37Z","timestamp":1697655397000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.20215"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,27]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,5]]}},"alternative-id":["10.1002\/jgt.20215"],"URL":"https:\/\/doi.org\/10.1002\/jgt.20215","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10,27]]}}}