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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

The algorithmic strength of planar graph colouring theorems

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Faculty of Education, Hills Road, Cambridge, CB2 8PQ Cambridge Climate Faculty of Law, Room LG18, Sidgwick Site

Other talks

When Programmes Disagree About Programmes: Code Poetry and the Problem of Programme–Programme Communication Discovery Investigations: Science, Empire and the Making of the British South Atlantic Wolfson Tool Factory Talk TBC Reproducibility In Astrophysical Simulations: The AGORA Initiative and a 14-Year Human Experiment (In Memory of Joel Primack) Title to be confirmed
 

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