3-Colouring Planar Graphs

Puntos clave

• Every n-vertex planar graph is shown to be 3-colourable with monochromatic components of size O(n^{4/9}).
• This shows a significant improvement over the previous bound of O(n^{1/2}), indicating stronger colourability.
• The analysis processes n vertices systematically, leveraging properties unique to planar graphs.
• These results could lead to new applications in graph theory and algorithm design in combinatorics.