File:Graham–Pollak partition.svg
Size of this PNG preview of this SVG file: 378 × 360 pixels. Other resolutions: 252 × 240 pixels | 504 × 480 pixels | 806 × 768 pixels | 1,075 × 1,024 pixels | 2,150 × 2,048 pixels.
Original file (SVG file, nominally 378 × 360 pixels, file size: 990 bytes)
 | 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: A partition of the edges of a complete graph K6 into five complete bipartite subgraphs. According to the Graham–Pollak theorem, it is not possible to find a partition into fewer complete bipartite subgraphs. |
| 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 | 20:26, 12 July 2020 | | 378 × 360 (990 bytes) | David Eppstein | Uploaded own work with UploadWizard |
File usage
The following 2 pages use this file:
Global file usage
The following other wikis use this file:
- Usage on fr.wikipedia.org
