Fractional Chromatic Numbers from Exact Decision Diagrams

Recently, Van Hoeve proposed an algorithm for graph coloring based on an integer flow formulation on decision diagrams for stable sets. We prove that the solution to the linear flow relaxation on exact decision diagrams determines the fractional chromatic number of a graph. This settles the question whether the decision diagram formulation or the fractional chromatic number establishes a stronger lower bound. It also establishes that the integrality gap of the linear programming relaxation is O(log n), where n represents the number of vertices in the graph. We also conduct experiments using exact decision diagrams and could determine the chromatic number of r1000.1c from the DIMACS benchmark set. It was previously unknown and is one of the few newly solved DIMACS instances in the last 10 years.
Comment: 11 pages, 1 Figure, 1 Table, source code published at https://github.com/trewes/ddcolors, Scripts, logfiles, results and instructions for the experiments are archived at https://bonndata.uni-bonn.de/dataset.xhtml?persistentId=doi:10.60507/FK2/ZE9C3L