Image:Erdős–Faber–Lovász conjecture.svg
From Wikipedia, the free encyclopedia
Erdős–Faber–Lovász_conjecture.svg (SVG file, nominally 574 × 612 pixels, file size: 4 KB)
| This is a file from the Wikimedia Commons. The description on its description page there is shown below.
|
[edit] Summary
| Description |
An instance of the Erdős–Faber–Lovász conjecture: four cliques of four vertices each, any two of which intersect in a single vertex, can be four-colored. |
|---|---|
| Source |
self-made |
| Date |
September 10, 2007 |
| Author | |
| Permission (Reusing this image) |
see below |
[edit] Licensing
 |
I, the copyright holder of this work, hereby release it into the public domain. This applies worldwide. In case this is not legally possible: Afrikaans | Alemannisch | Aragonés | العربية | Asturianu | Български | Català | Česky | Cymraeg | Dansk | Deutsch | Eʋegbe | Ελληνικά | English | Español | Esperanto | Euskara | Estremeñu | فارسی | Français | Galego | 한국어 | हिन्दी | Hrvatski | Ido | Bahasa Indonesia | Íslenska | Italiano | עברית | Kurdî / كوردی | Latina | Lietuvių | Latviešu | Magyar | Македонски | Bahasa Melayu | Nederlands | Norsk (bokmål) | Norsk (nynorsk) | 日本語 | Polski | Português | Ripoarisch | Română | Русский | Shqip | Slovenčina | Slovenščina | Српски / Srpski | Svenska | ไทย | Tagalog | Türkçe | Українська | Tiếng Việt | Walon | 中文(简体) | 中文(繁體) | zh-yue-hant | +/- |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Dimensions | User | Comment | |
|---|---|---|---|---|
| current | 17:27, 10 September 2007 | 574×612 (4 KB) | David Eppstein | ({{Information |Description=An instance of the Erdős–Faber–Lovász conjecture: four cliques of four vertices each, any two of which intersect in a single vertex, can be four-colored. |Source=self-made |Date=) |
