Image: Graham–Pollak partition
Size of this PNG preview of this SVG file: 378 × 360 pixels. Other resolution: 252 × 240 pixels.
Original image (SVG file, nominally 378 × 360 pixels, file size: 990 bytes)
Description: 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.
Title: Graham–Pollak partition
Credit: Own work
Author: David Eppstein
Usage Terms: Creative Commons Zero, Public Domain Dedication
License: CC0
License Link: http://creativecommons.org/publicdomain/zero/1.0/deed.en
Attribution Required?: No
Image usage
The following page links to this image:
All content from Kiddle encyclopedia articles (including the article images and facts) can be freely used under Attribution-ShareAlike license, unless stated otherwise.
