Solving Graph Coloring Problems with Abstraction and Symmetry


This paper introduces a general methodology, based on abstraction and symmetry, that applies to solve hard graph edge-coloring problems and demonstrates its use to provide further evidence that the Ramsey number R(4, 3, 3) = 30. The number R(4, 3, 3) is often presented as the unknown Ramsey number with the best chances of being found “soon”. Yet, its… (More)


7 Figures and Tables

Slides referencing similar topics