Lecture

Graph Coloring III

Description

This lecture covers the properties of clusters and the colorability threshold in graph coloring, including average connectivity, clustering, condensation, rigidity, and the COL/UNCOL problem. The instructor discusses the properties deduced from the contiguity of random and planted graph coloring, as well as more generic concepts like BP fixed points and complexity of clusters.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.