Loading...
Please wait, while we are loading the content...
Similar Documents
Density of Chromatic Roots in Minor-Closed Graph Families
| Content Provider | Scilit |
|---|---|
| Author | Perrett, Thomas J. Thomassen, Carsten |
| Copyright Year | 2018 |
| Description | We prove that the roots of the chromatic polynomials of planar graphs are dense in the interval between 32/27 and 4, except possibly in a small interval around τ + 2 where τ is the golden ratio. This interval arises due to a classical result of Tutte, which states that the chromatic polynomial of every planar graph takes a positive value at τ + 2. Our results lead us to conjecture that τ + 2 is the only such number less than 4. |
| Related Links | https://backend.orbit.dtu.dk/ws/files/162444848/2.pdf https://www.cambridge.org/core/services/aop-cambridge-core/content/view/8C481CED690A7405B98F3B679F946C46/S0963548318000184a.pdf/div-class-title-density-of-chromatic-roots-in-minor-closed-graph-families-div.pdf |
| Ending Page | 998 |
| Page Count | 11 |
| Starting Page | 988 |
| ISSN | 09635483 |
| e-ISSN | 14692163 |
| DOI | 10.1017/s0963548318000184 |
| Journal | Combinatorics, Probability and Computing |
| Issue Number | 6 |
| Volume Number | 27 |
| Language | English |
| Publisher | Cambridge University Press (CUP) |
| Publisher Date | 2018-11-01 |
| Access Restriction | Open |
| Subject Keyword | Combinatorics, Probability and Computing Mathematical Physics Primary 05c31 Secondary 05c15 |
| Content Type | Text |
| Resource Type | Article |
| Subject | Applied Mathematics Statistics and Probability Theoretical Computer Science Computational Theory and Mathematics |
