File:K5 triangle packing and covering.svg
Jump to navigation
Jump to search
Size of this PNG preview of this SVG file: 774 × 333 pixels. Other resolutions: 320 × 138 pixels | 640 × 275 pixels | 1,024 × 441 pixels | 1,280 × 551 pixels | 2,560 × 1,101 pixels.
Original file (SVG file, nominally 774 × 333 pixels, file size: 861 bytes)
Captions
Captions
Packing and covering triangles in the complete graph K5
Summary[edit]
| Description |
English: Packing and covering triangles in the complete graph K5. The maximum number of edge-disjoint triangles in this graph is two (left). If four edges are removed from the graph, the remaining subgraph becomes triangle-free, and more strongly bipartite (right). According to Tuza's conjecture, in any graph, it is possible to remove twice as many edges as the maximum triangle packing size, and eliminate all triangles. |
| Date | |
| Source | Own work |
| Author | David Eppstein |
Licensing[edit]
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 | 20:55, 7 March 2023 | | 774 × 333 (861 bytes) | David Eppstein (talk | contribs) | Uploaded own work with UploadWizard |
You cannot overwrite this file.
File usage on Commons
The following page uses this file:
File usage on other wikis
The following other wikis use this file:
- Usage on en.wikipedia.org
