{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:39:56Z","timestamp":1787323196299,"version":"build-2736575974"},"reference-count":36,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2015,1]]},"abstract":"<jats:p>We prove that the (real or complex) chromatic roots of a series-parallel graph with maxmaxflow $\\Lambda$ lie in the disc $|q-1| &lt; (\\Lambda-1)\/\\log 2$. More generally, the same bound holds for the (real or complex) roots of the multivariate Tutte polynomial when the edge weights lie in the \u201creal antiferromagnetic regime\u201d $-1 \\le v_e \\le 0$. For each $\\Lambda \\geq 3$, we exhibit a family of graphs, namely, the \u201cleaf-joined trees\u201d, with maxmaxflow $\\Lambda$ and chromatic roots accumulating densely on the circle $|q-1|=\\Lambda -1$, thereby showing that our result is within a factor $1\/\\log 2 \\approx 1.442695$ of being sharp.<\/jats:p>","DOI":"10.1137\/130930133","type":"journal-article","created":{"date-parts":[[2015,10,29]],"date-time":"2015-10-29T10:49:52Z","timestamp":1446115792000},"page":"2117-2159","source":"Crossref","is-referenced-by-count":3,"title":["Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs"],"prefix":"10.1137","volume":"29","author":[{"given":"Gordon F.","family":"Royle","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alan D.","family":"Sokal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2015,10,29]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90039-3"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(72)90016-0"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1946-0018401-4"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010070"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548305006942"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758777"},{"key":"atypb7","doi-asserted-by":"crossref","unstructured":"A. Brandsta\u0308dt, V.B. Le, and J.P. Spinrad,\n                      Graph Classes: A Survey\n                      , Discrete Math. Appl., SIAM, Philadelphia, 1999.","DOI":"10.1137\/1.9780898719796"},{"key":"atypb8","first-page":"43","author":"Brawley J.V.","year":"2001","journal-title":"Berlin"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1994-002-3"},{"key":"atypb10","unstructured":"C.J. Colbourn,\n                      The Combinatorics of Network Reliability\n                      , Clarendon Press\/Oxford University Press, New York, 1987."},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1007\/BF02124750"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(65)90125-3"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(80)90003-5"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548307008632"},{"key":"atypb15","doi-asserted-by":"crossref","unstructured":"G. Grimmett,\n                      The Random-Cluster Model\n                      , Springer-Verlag, Berlin, 2006.","DOI":"10.1007\/978-3-540-32891-9"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1007\/s00022-003-1694-y"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2012.08.002"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2009.03.002"},{"key":"atypb19","doi-asserted-by":"crossref","first-page":"R99","DOI":"10.37236\/371","volume":"17","author":"Jackson B.","year":"2010","journal-title":"Electron. J. Combin."},{"key":"atypb20","first-page":"97","author":"Oxley J.","year":"1986","journal-title":"Cambridge"},{"key":"atypb21","unstructured":"J.G. Oxley,\n                      Matroid Theory\n                      , Oxford University Press, New York, 1992."},{"key":"atypb22","doi-asserted-by":"crossref","unstructured":"Q.I. Rahman and G. Schmeisser,\n                      Analytic Theory of Polynomials\n                      , Clarendon Press\/Oxford University Press, Oxford, 2002.","DOI":"10.1093\/oso\/9780198534938.001.0001"},{"key":"atypb23","first-page":"1009","author":"Read R.C.","year":"1991","journal-title":"New York"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.03.008"},{"key":"atypb25","first-page":"289","author":"Royle G.F.","year":"2009","journal-title":"Cambridge"},{"key":"atypb26","unstructured":"G.F. Royle and A.D. Sokal,\n                      Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graph\n                      , expanded version, preprint, arXiv.1307.1721, 2013."},{"key":"atypb27","unstructured":"J. Salas and A.D. Sokal,\n                      Chromatic Roots of the Complete Bipartite Graphs\n                      , manuscript, 2015."},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/31\/48\/003"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4371(98)00568-8"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300004612"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548303006023"},{"key":"atypb32","first-page":"173","author":"Sokal A.D.","year":"2005","journal-title":"Cambridge"},{"key":"atypb33","doi-asserted-by":"crossref","unstructured":"J.P. Spinrad,\n                      Efficient Graph Representations\n                      , AMS, Providence RI, 2003.","DOI":"10.1090\/fim\/019"},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548397003131"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1137\/0211023"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548399004162"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/130930133","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:47:20Z","timestamp":1787320040000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/130930133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["10.1137\/130930133"],"URL":"https:\/\/doi.org\/10.1137\/130930133","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}