Formalising Turán's Graph Theorem in Isabelle/HOL
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Angeliki KoutsoukouArgyraki.
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 pclique, contains at most (11/(p1))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/engb/microsoftteams/joinameeting?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:
Note that exdirectory lists are not shown.
