DeepAI

A Constructive Formalization of the Weak Perfect Graph Theorem

The Perfect Graph Theorems are important results in graph theory describing the relationship between clique number ω(G) and chromatic number χ(G) of a graph G. A graph G is called perfect if χ(H)=ω(H) for every induced subgraph H of G. The Strong Perfect Graph Theorem (SPGT) states that a graph is perfect if and only if it does not contain an odd hole (or an odd anti-hole) as its induced subgraph. The Weak Perfect Graph Theorem (WPGT) states that a graph is perfect if and only if its complement is perfect. In this paper, we present a formal framework for working with finite simple graphs. We model finite simple graphs in the Coq Proof Assistant by representing its vertices as a finite set over a countably infinite domain. We argue that this approach provides a formal framework in which it is convenient to work with different types of graph constructions (or expansions) involved in the proof of the Lovász Replication Lemma (LRL), which is also the key result used in the proof of Weak Perfect Graph Theorem. Finally, we use this setting to develop a constructive formalization of the Weak Perfect Graph Theorem.

• 5 publications
• 3 publications
12/28/2018

Towards a constructive formalization of Perfect Graph Theorems

Interaction between clique number ω(G) and chromatic number χ(G) of a ...
03/10/2022

Constructible Graphs and Pursuit

A (finite or infinite) graph is called constructible if it may be obtain...
06/16/2021

Colouring graphs with no induced six-vertex path or diamond

The diamond is the graph obtained by removing an edge from the complete ...
04/06/2021

Coloring graph classes with no induced fork via perfect divisibility

For a graph G, χ(G) will denote its chromatic number, and ω(G) its cliqu...
02/08/2020

Majority Voting and the Condorcet's Jury Theorem

There is a striking relationship between a three hundred years old Polit...
07/15/2022

Improved Algorithms for Recognizing Perfect Graphs and Finding Shortest Odd and Even Holes

Various classes of induced subgraphs are involved in the deepest results...
12/14/2022

Unfoldings and coverings of weighted graphs

Coverings of undirected graphs are used in distributed computing, and un...