Coder Social home page Coder Social logo

graph-theory's Introduction

Graph Theory

Docker CI Chat Contributing Code of Conduct Zulip DOI

A library of formalized graph theory results, including various standard results from the literature (e.g., Menger's Theorem, Hall's Marriage Theorem, the excluded minor characterization of treewidth-two graphs, and Wagner's Theorem) as well as some more recent results arising from the study of relation algebra within the ERC CoVeCe project (e.g., soundness and completeness of an axiomatization of graph isomorphism).

Meta

Building and installation instructions

To manually build and install the whole project, including Wagner's theorem which requires the Coq proof of the Four-Color Theorem, do:

git clone https://github.com/coq-community/graph-theory.git
cd graph-theory
make   # or make -j <number-of-cores-on-your-machine> 
make install

However, the easiest way to install released versions of Graph Theory libraries selectively is via opam:

opam repo add coq-released https://coq.inria.fr/opam/released
opam install coq-graph-theory # core library
opam install coq-graph-theory-planar # planarity results depending on coq-fourcolor

Documentation

This project contains:

  • a general purpose Coq library about graph theory:
    • directed graphs, simple graphs, multigraphs
    • paths, trees, forests, isomorphism, connected components, etc.
    • minors and tree decompositions
    • Menger's theorem and some of its corollaries (Hall's marriage theorem and König's theorem)
    • the excluded-minor characterisation of treewidth at most two graphs (as those excluding K4 as a minor)
  • soundness and completeness of an axiomatization of isomorphism of two-pointed treewidth-two (2p) multigraphs:
    • isomorphisms up to label-equivalence and edge-flipping for multigraphs
    • 2p graphs form a 2p algebra and thus also a 2pdom algebra
    • every K4-free graph can be represented by a 2p-term
    • 2pdom axioms are complete w.r.t. graph isomorphism for connected 2p graphs.
  • a proof of Wagner's theorem (planarity of K5 and K3,3 graphs) based on combinatorial hypermaps
  • two proofs of the weak perfect graph theorem (WPGT):
    • one proof based on Lovasz's replication lemma
    • one proof based on a matrix rank argument

Additional information on the contents of individual files is available at the project website.

graph-theory's People

Contributors

aureus123 avatar chdoc avatar damien-pous avatar mauriciosalichs avatar palmskog avatar pi8027 avatar proux01 avatar zimmi48 avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

graph-theory's Issues

Consitently use documentation comments (** *) for explanations.

In order to obtain decently looking documentation, we should consistent in our use of comments and documentation:

  • documentation comments (** *) for everything that qualifies as explanation (rendered in highlighted boxes in the documentation).
  • regular comments (* *) for TODO and TOTHINK comments and the like, that are internal (rendered as greyed-out text)

(edit: comments inside proofs must always be regular comments, as documentation inside proofs messes up coqdocjs code folding)

GitHub release or tag for Coq 8.11 and MathComp 1.10.0

It would be very useful (e.g., for reusing/integrating code) if the project had a GitHub release or Git tag which is guaranteed to support Coq 8.11 and MathComp 1.9.0 + 1.10.0. The main rationale is that when looking only at repository code, it's usually a lot of work to figure out the compatibility status of a given revision.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.