The algorithmic strength of planar graph colouring theorems

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

• Selwyn Ng (Nanyang Technological University)
• Monday 06 June 2022, 10:00-11:00
• Seminar Room 1, Newton Institute.

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:

• All CMS events
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• Seminar Room 1, Newton Institute
• bld31

Note that ex-directory lists are not shown.