![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Thursday 02 March 2023, 17:00-18:00
Formalising Turán's Graph Theorem in Isabelle/HOL
- 👤 Speaker: Nils Lauermann (INRIA)
- 📅 Date & Time: Thursday 02 March 2023, 17:00 - 18:00
- 📍 Venue: Centre for Mathematical Sciences MR12, CMS
Abstract
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
Series This talk is part of the Formalisation of mathematics with interactive theorem provers series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Centre for Mathematical Sciences MR12, CMS
- CMS Events
- Department of Computer Science and Technology talks and seminars
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- DPMMS Pure Maths study groups
- Formalisation of mathematics with interactive theorem provers
- Hanchen DaDaDash
- Interested Talks
- Martin's interesting talks
- School of Physical Sciences
- School of Technology
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.