File:Graphic matroid parity.svg
Size of this PNG preview of this SVG file: 324 × 423 pixels. Other resolutions: 184 × 240 pixels | 368 × 480 pixels | 588 × 768 pixels | 784 × 1,024 pixels | 1,569 × 2,048 pixels.
Original file (SVG file, nominally 324 × 423 pixels, file size: 1 KB)
 | This is a file from the Wikimedia Commons. Information from its description page there is shown below. Commons is a freely licensed media file repository. You can help. |
Summary
| Description |
English: An instance of the matroid parity problem on a graphic matroid: given a graph with colored edges, having exactly two edges per color, find as large a forest as possible that again has exactly two edges per color. |
| Date | |
| Source | Own work |
| Author | David Eppstein |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
 
|
This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication. |
| The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
|
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 05:31, 19 December 2017 | | 324 × 423 (1 KB) | David Eppstein | User created page with UploadWizard |
File usage
The following page uses this file:
