| Home |
| About |
| Submission |
| Updating Entries |
| Using Entries |
| Search |
| Statistics |
| Index |
| Download |
Matroids
| Title: | Matroids |
| Author: | Jonas Keinholz |
| Submission date: | 2018-11-16 |
| Abstract: |
This article defines the combinatorial structures known as Independence Systems and Matroids and provides basic concepts and theorems related to them. These structures play an important role in combinatorial optimisation, e. g. greedy algorithms such as Kruskal's algorithm. The development is based on Oxley's `What is a Matroid?'. |
| BibTeX: |
@article{Matroids-AFP,
author = {Jonas Keinholz},
title = {Matroids},
journal = {Archive of Formal Proofs},
month = nov,
year = 2018,
note = {\url{http://isa-afp.org/entries/Matroids.html},
Formal proof development},
ISSN = {2150-914x},
}
|
| License: | BSD License |
| Used by: | Kruskal |
|
Proof outline Proof document |
| Browse theories |
| Download this entry |
| Older releases: None |