6,762 research outputs found

    A note on coloring vertex-transitive graphs

    Full text link
    We prove bounds on the chromatic number Ο‡\chi of a vertex-transitive graph in terms of its clique number Ο‰\omega and maximum degree Ξ”\Delta. We conjecture that every vertex-transitive graph satisfies χ≀max⁑{Ο‰,⌈5Ξ”+36βŒ‰}\chi \le \max \left\{\omega, \left\lceil\frac{5\Delta + 3}{6}\right\rceil\right\} and we prove results supporting this conjecture. Finally, for vertex-transitive graphs with Ξ”β‰₯13\Delta \ge 13 we prove the Borodin-Kostochka conjecture, i.e., χ≀max⁑{Ο‰,Ξ”βˆ’1}\chi\le\max\{\omega,\Delta-1\}

    A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings

    Get PDF
    Combining tree decomposition and transfer matrix techniques provides a very general algorithm for computing exact partition functions of statistical models defined on arbitrary graphs. The algorithm is particularly efficient in the case of planar graphs. We illustrate it by computing the Potts model partition functions and chromatic polynomials (the number of proper vertex colourings using Q colours) for large samples of random planar graphs with up to N=100 vertices. In the latter case, our algorithm yields a sub-exponential average running time of ~ exp(1.516 sqrt(N)), a substantial improvement over the exponential running time ~ exp(0.245 N) provided by the hitherto best known algorithm. We study the statistics of chromatic roots of random planar graphs in some detail, comparing the findings with results for finite pieces of a regular lattice.Comment: 5 pages, 3 figures. Version 2 has been substantially expanded. Version 3 shows that the worst-case running time is sub-exponential in the number of vertice

    A general framework for coloring problems: old results, new results, and open problems

    Get PDF
    In this survey paper we present a general framework for coloring problems that was introduced in a joint paper which the author presented at WG2003. We show how a number of different types of coloring problems, most of which have been motivated from frequency assignment, fit into this framework. We give a survey of the existing results, mainly based on and strongly biased by joint work of the author with several different groups of coauthors, include some new results, and discuss several open problems for each of the variants
    • …
    corecore