Graph colouring via entropy compression

图和超图是对网络进行建模的数学结构。图和超图的着色是调度、计算导数、密码学和编码理论等许多领域中的一个关键问题。该项目将应用一种名为“熵压缩”的革命性方法，以产生新的数学工具和算法，为图表和超图上色。这些结果将对上述应用产生重要的影响，并且在图论本身也将具有基本的重要性。

Graphs and hypergraphs are mathematical structures that model networks. Colouring graphs and hypergraphs is a key problem in many fields including scheduling, computing derivatives, cryptography, and coding theory. This project will apply a revolutionary method called "entropy compression" to produce new mathematical tools and algorithms for colouring graphs and hypergraphs. These results will have significant ramifications for the above applications, and will also be of fundamental importance in graph theory itself.