Formalising Turán's Graph Theorem in Isabelle/HOL

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

• Nils Lauermann (INRIA)
• Thursday 02 March 2023, 17:00-18:00
• Centre for Mathematical Sciences MR12, CMS.

If you have a question about this talk, please contact Angeliki Koutsoukou-Argyraki.

Hybrid talk (please see abstract for link)

In 1941, Paul Turán discovered that any undirected, simple graph with n vertices that does not contain a p-clique, contains at most (1-1/(p-1))n^2/2 edges. Turán’s graph theorem is considered to be a fundamental result in graph theory and the origin of the field of extremal graph theory. In my formalisation of Turán’s graph theorem in Isabelle/HOL, I have first directly adapted Turán’s original proof. Then, I discovered a seemingly small change to the textbook proof on paper which significantly decreases the size of the formalisation and leads to an arguably more beautiful proof.

WATCH ONLINE HERE : https://www.microsoft.com/en-gb/microsoft-teams/join-a-meeting?rtc=1 Meeting ID: 379 992 884 209 Passcode: TYR8 Sh

This talk is part of the Formalisation of mathematics with interactive theorem provers series.

This talk is included in these lists:

• Centre for Mathematical Sciences MR12, CMS
• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge talks
• DPMMS Lists
• DPMMS Pure Maths study groups
• DPMMS info aggregator
• DPMMS lists
• Department of Computer Science and Technology talks and seminars
• Formalisation of mathematics with interactive theorem provers
• Hanchen DaDaDash
• Interested Talks
• School of Physical Sciences
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.