# Mathematics/Graph Theory

## 2022

## 2021

Roth's Theorem on Arithmetic Progressions

by Chelsea Edmonds, Angeliki Koutsoukou-Argyraki and Lawrence C. Paulson

Szemerédi's Regularity Lemma

by Chelsea Edmonds, Angeliki Koutsoukou-Argyraki and Lawrence C. Paulson

## 2020

Relational Characterisations of Paths

by Walter Guttmann and Peter Höfner

## 2018

Upper Bounding Diameters of State Spaces of Factored Transition Systems

by Friedrich Kurz and Mohammad Abdulaziz

## 2017

Formalizing Push-Relabel Algorithms

by Peter Lammich and S. Reza Sefidgar

Flow Networks and the Min-Cut-Max-Flow Theorem

by Peter Lammich and S. Reza Sefidgar

## 2016

A Formal Proof of the Max-Flow Min-Cut Theorem for Countable Networks

by Andreas Lochbihler

## 2015

## 2014

Verified Efficient Implementation of Gabow's Strongly Connected Components Algorithm

by Peter Lammich

Properties of Random Graphs -- Subgraph Containment

by Lars Hupel

## 2013

The Königsberg Bridge Problem and the Friendship Theorem

by Wenda Li

An Axiomatic Characterization of the Single-Source Shortest Path Problem

by Christine Rizkallah

## 2012

A Probabilistic Proof of the Girth-Chromatic Number Theorem

by Lars Noschinski