<> <http://www.w3.org/2000/01/rdf-schema#comment> "The repository administrator has not yet configured an RDF license."^^<http://www.w3.org/2001/XMLSchema#string> .
<> <http://xmlns.com/foaf/0.1/primaryTopic> <https://discovery.ucl.ac.uk/id/eprint/1399078> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/AcademicArticle> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Article> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://purl.org/dc/terms/title> "Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://purl.org/ontology/bibo/abstract> "We prove that the (real or complex) chromatic roots of a series-parallel graph with maxmaxflow $\\Lambda$ lie in the disc $|q-1| < (\\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 “real antiferromagnetic regime” $-1 \\le v_e \\le 0$. For each $\\Lambda \\geq 3$, we exhibit a family of graphs, namely, the “leaf-joined trees”, 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."^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://purl.org/dc/terms/date> "2015-01-01" .
<https://discovery.ucl.ac.uk/id/document/351099> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Document> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://purl.org/ontology/bibo/volume> "29" .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://purl.org/ontology/bibo/issue> "4" .
<https://discovery.ucl.ac.uk/id/org/ext-88d7c77465bce319adbce26ea43702a5> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Organization> .
<https://discovery.ucl.ac.uk/id/org/ext-88d7c77465bce319adbce26ea43702a5> <http://xmlns.com/foaf/0.1/name> "SIAM PUBLICATIONS"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://purl.org/dc/terms/publisher> <https://discovery.ucl.ac.uk/id/org/ext-88d7c77465bce319adbce26ea43702a5> .
<https://discovery.ucl.ac.uk/id/publication/ext-08954801> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Collection> .
<https://discovery.ucl.ac.uk/id/publication/ext-08954801> <http://xmlns.com/foaf/0.1/name> "SIAM Journal on Discrete Mathematics"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://purl.org/dc/terms/isPartOf> <https://discovery.ucl.ac.uk/id/publication/ext-08954801> .
<https://discovery.ucl.ac.uk/id/publication/ext-08954801> <http://www.w3.org/2002/07/owl#sameAs> <urn:issn:08954801> .
<https://discovery.ucl.ac.uk/id/publication/ext-08954801> <http://purl.org/ontology/bibo/issn> "08954801" .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://purl.org/ontology/bibo/status> <http://purl.org/ontology/bibo/status/published> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-03b7552f933524e57e9f56abec1004ab> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/1399078#authors> .
<https://discovery.ucl.ac.uk/id/eprint/1399078#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_1> <https://discovery.ucl.ac.uk/id/person/ext-03b7552f933524e57e9f56abec1004ab> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-2ee99b310fdc05318803b6d33f23e044> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/1399078#authors> .
<https://discovery.ucl.ac.uk/id/eprint/1399078#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_2> <https://discovery.ucl.ac.uk/id/person/ext-2ee99b310fdc05318803b6d33f23e044> .
<https://discovery.ucl.ac.uk/id/person/ext-03b7552f933524e57e9f56abec1004ab> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-03b7552f933524e57e9f56abec1004ab> <http://xmlns.com/foaf/0.1/givenName> "GF"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-03b7552f933524e57e9f56abec1004ab> <http://xmlns.com/foaf/0.1/familyName> "Royle"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-03b7552f933524e57e9f56abec1004ab> <http://xmlns.com/foaf/0.1/name> "GF Royle"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-2ee99b310fdc05318803b6d33f23e044> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-2ee99b310fdc05318803b6d33f23e044> <http://xmlns.com/foaf/0.1/givenName> "AD"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-2ee99b310fdc05318803b6d33f23e044> <http://xmlns.com/foaf/0.1/familyName> "Sokal"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-2ee99b310fdc05318803b6d33f23e044> <http://xmlns.com/foaf/0.1/name> "AD Sokal"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/EPrint> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/ArticleEPrint> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://purl.org/dc/terms/isPartOf> <https://discovery.ucl.ac.uk/id/repository> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/351099> .
<https://discovery.ucl.ac.uk/id/document/351099> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/351099> <http://www.w3.org/2000/01/rdf-schema#label> "Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs (Text)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://purl.org/dc/elements/1.1/hasVersion> <https://discovery.ucl.ac.uk/id/document/351099> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://eprints.org/ontology/hasPublished> <https://discovery.ucl.ac.uk/id/document/351099> .
<https://discovery.ucl.ac.uk/id/document/351099> <http://eprints.org/ontology/hasFile> <https://discovery.ucl.ac.uk/id/eprint/1399078/1/Sokal_130930133.pdf> .
<https://discovery.ucl.ac.uk/id/document/351099> <http://purl.org/dc/terms/hasPart> <https://discovery.ucl.ac.uk/id/eprint/1399078/1/Sokal_130930133.pdf> .
<https://discovery.ucl.ac.uk/id/eprint/1399078/1/Sokal_130930133.pdf> <http://www.w3.org/2000/01/rdf-schema#label> "Sokal_130930133.pdf"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/351100> .
<https://discovery.ucl.ac.uk/id/document/351100> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/351100> <http://www.w3.org/2000/01/rdf-schema#label> "Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/351100> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/351099> .
<https://discovery.ucl.ac.uk/id/document/351100> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/351099> .
<https://discovery.ucl.ac.uk/id/document/351100> <http://eprints.org/relation/islightboxThumbnailVersionOf> <https://discovery.ucl.ac.uk/id/document/351099> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/351101> .
<https://discovery.ucl.ac.uk/id/document/351101> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/351101> <http://www.w3.org/2000/01/rdf-schema#label> "Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/351101> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/351099> .
<https://discovery.ucl.ac.uk/id/document/351101> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/351099> .
<https://discovery.ucl.ac.uk/id/document/351101> <http://eprints.org/relation/ispreviewThumbnailVersionOf> <https://discovery.ucl.ac.uk/id/document/351099> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/351102> .
<https://discovery.ucl.ac.uk/id/document/351102> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/351102> <http://www.w3.org/2000/01/rdf-schema#label> "Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/351102> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/351099> .
<https://discovery.ucl.ac.uk/id/document/351102> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/351099> .
<https://discovery.ucl.ac.uk/id/document/351102> <http://eprints.org/relation/ismediumThumbnailVersionOf> <https://discovery.ucl.ac.uk/id/document/351099> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/351103> .
<https://discovery.ucl.ac.uk/id/document/351103> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/351103> <http://www.w3.org/2000/01/rdf-schema#label> "Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/351103> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/351099> .
<https://discovery.ucl.ac.uk/id/document/351103> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/351099> .
<https://discovery.ucl.ac.uk/id/document/351103> <http://eprints.org/relation/issmallThumbnailVersionOf> <https://discovery.ucl.ac.uk/id/document/351099> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/351158> .
<https://discovery.ucl.ac.uk/id/document/351158> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/351158> <http://www.w3.org/2000/01/rdf-schema#label> "Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/351158> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/351099> .
<https://discovery.ucl.ac.uk/id/document/351158> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/351099> .
<https://discovery.ucl.ac.uk/id/document/351158> <http://eprints.org/relation/isIndexCodesVersionOf> <https://discovery.ucl.ac.uk/id/document/351099> .
<https://discovery.ucl.ac.uk/id/document/351158> <http://eprints.org/ontology/hasFile> <https://discovery.ucl.ac.uk/id/eprint/1399078/6/indexcodes.txt> .
<https://discovery.ucl.ac.uk/id/document/351158> <http://purl.org/dc/terms/hasPart> <https://discovery.ucl.ac.uk/id/eprint/1399078/6/indexcodes.txt> .
<https://discovery.ucl.ac.uk/id/eprint/1399078/6/indexcodes.txt> <http://www.w3.org/2000/01/rdf-schema#label> "indexcodes.txt"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1399078> <http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://discovery.ucl.ac.uk/id/eprint/1399078/> .
<https://discovery.ucl.ac.uk/id/eprint/1399078/> <http://purl.org/dc/elements/1.1/title> "HTML Summary of #1399078 \n\nLinear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs\n\n" .
<https://discovery.ucl.ac.uk/id/eprint/1399078/> <http://purl.org/dc/elements/1.1/format> "text/html" .
<https://discovery.ucl.ac.uk/id/eprint/1399078/> <http://xmlns.com/foaf/0.1/primaryTopic> <https://discovery.ucl.ac.uk/id/eprint/1399078> .