University of Cambridge > > Isaac Newton Institute Seminar Series > The algorithmic strength of planar graph colouring theorems

The algorithmic strength of planar graph colouring theorems

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact nobody.

SASW09 - International conference on computability, complexity and randomness

We discuss the $k$-colour theorem for planar graphs, in the context of reverse mathematics as well as the uniform reducibility between the different parameterized versions of the $k$-colour theorem. We show that there is a proper hierarchy of principles corresponding to different parameters and restrictions on the graph.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity