File:K5 triangle packing and covering.svg
Summary
| 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
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.
|
